./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 06:20:32,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 06:20:32,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 06:20:32,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 06:20:32,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 06:20:32,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 06:20:32,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 06:20:32,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 06:20:32,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 06:20:32,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 06:20:32,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 06:20:32,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 06:20:32,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 06:20:32,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 06:20:32,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 06:20:32,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 06:20:32,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 06:20:32,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 06:20:32,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 06:20:32,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 06:20:32,225 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 06:20:32,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 06:20:32,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 06:20:32,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 06:20:32,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 06:20:32,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 06:20:32,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 06:20:32,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 06:20:32,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 06:20:32,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 06:20:32,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 06:20:32,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 06:20:32,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 06:20:32,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 06:20:32,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 06:20:32,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 06:20:32,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 06:20:32,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 06:20:32,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 06:20:32,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 06:20:32,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 06:20:32,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 06:20:32,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 06:20:32,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 06:20:32,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 06:20:32,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 06:20:32,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 06:20:32,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 06:20:32,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 06:20:32,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 06:20:32,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 06:20:32,306 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 06:20:32,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 06:20:32,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 06:20:32,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 06:20:32,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 06:20:32,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 06:20:32,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 06:20:32,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 06:20:32,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 06:20:32,308 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 06:20:32,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 06:20:32,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 06:20:32,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 06:20:32,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 06:20:32,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 06:20:32,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 06:20:32,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:20:32,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 06:20:32,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 06:20:32,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 06:20:32,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 06:20:32,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 06:20:32,310 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 06:20:32,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 06:20:32,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 06:20:32,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2022-07-21 06:20:32,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 06:20:32,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 06:20:32,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 06:20:32,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 06:20:32,809 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 06:20:32,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-07-21 06:20:32,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6987c6e4b/db7746a3fd6a45d897c82cabb464bf92/FLAGb079eb082 [2022-07-21 06:20:33,604 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 06:20:33,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-07-21 06:20:33,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6987c6e4b/db7746a3fd6a45d897c82cabb464bf92/FLAGb079eb082 [2022-07-21 06:20:33,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6987c6e4b/db7746a3fd6a45d897c82cabb464bf92 [2022-07-21 06:20:33,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 06:20:33,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 06:20:33,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 06:20:33,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 06:20:33,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 06:20:33,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:20:33" (1/1) ... [2022-07-21 06:20:33,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f40177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:33, skipping insertion in model container [2022-07-21 06:20:33,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:20:33" (1/1) ... [2022-07-21 06:20:33,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 06:20:33,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 06:20:34,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2022-07-21 06:20:34,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:20:34,556 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 06:20:34,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2022-07-21 06:20:34,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:20:34,734 INFO L208 MainTranslator]: Completed translation [2022-07-21 06:20:34,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34 WrapperNode [2022-07-21 06:20:34,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 06:20:34,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 06:20:34,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 06:20:34,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 06:20:34,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,852 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2022-07-21 06:20:34,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 06:20:34,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 06:20:34,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 06:20:34,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 06:20:34,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 06:20:34,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 06:20:34,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 06:20:34,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 06:20:34,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (1/1) ... [2022-07-21 06:20:34,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:20:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:35,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 06:20:35,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 06:20:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 06:20:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 06:20:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 06:20:35,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 06:20:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 06:20:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 06:20:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 06:20:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-07-21 06:20:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-07-21 06:20:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-21 06:20:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-21 06:20:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-21 06:20:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-21 06:20:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 06:20:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-21 06:20:35,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-21 06:20:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:20:35,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:20:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 06:20:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 06:20:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-21 06:20:35,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-21 06:20:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 06:20:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-21 06:20:35,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-21 06:20:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 06:20:35,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 06:20:35,377 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 06:20:35,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 06:20:35,852 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-07-21 06:20:35,852 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-21 06:20:35,852 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:20:35,863 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:20:35,863 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-21 06:20:35,864 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:20:35,864 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-21 06:20:37,719 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 06:20:37,737 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 06:20:37,737 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 06:20:37,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:20:37 BoogieIcfgContainer [2022-07-21 06:20:37,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 06:20:37,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 06:20:37,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 06:20:37,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 06:20:37,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 06:20:33" (1/3) ... [2022-07-21 06:20:37,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf6dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:20:37, skipping insertion in model container [2022-07-21 06:20:37,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:34" (2/3) ... [2022-07-21 06:20:37,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf6dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:20:37, skipping insertion in model container [2022-07-21 06:20:37,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:20:37" (3/3) ... [2022-07-21 06:20:37,745 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2022-07-21 06:20:37,774 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 06:20:37,774 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 06:20:37,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 06:20:37,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76eb9d6b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e86e774 [2022-07-21 06:20:37,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 06:20:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-21 06:20:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 06:20:37,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:37,902 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:37,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2022-07-21 06:20:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:37,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253839633] [2022-07-21 06:20:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 06:20:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:20:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:20:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 06:20:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 06:20:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 06:20:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 06:20:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 06:20:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 06:20:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:20:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:38,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253839633] [2022-07-21 06:20:38,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253839633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:38,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:38,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 06:20:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599424106] [2022-07-21 06:20:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:38,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 06:20:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 06:20:38,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 06:20:38,645 INFO L87 Difference]: Start difference. First operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:38,739 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2022-07-21 06:20:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 06:20:38,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-21 06:20:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:38,750 INFO L225 Difference]: With dead ends: 348 [2022-07-21 06:20:38,751 INFO L226 Difference]: Without dead ends: 171 [2022-07-21 06:20:38,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 06:20:38,760 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:38,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:20:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-21 06:20:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-21 06:20:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-21 06:20:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2022-07-21 06:20:38,839 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2022-07-21 06:20:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:38,845 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2022-07-21 06:20:38,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-07-21 06:20:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 06:20:38,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:38,861 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:38,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 06:20:38,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2022-07-21 06:20:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:38,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597653105] [2022-07-21 06:20:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 06:20:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:20:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:20:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 06:20:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 06:20:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 06:20:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 06:20:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 06:20:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 06:20:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:20:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597653105] [2022-07-21 06:20:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597653105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:39,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:39,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:20:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404408564] [2022-07-21 06:20:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:39,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:20:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:20:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:20:39,349 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:39,425 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2022-07-21 06:20:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:20:39,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-21 06:20:39,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:39,431 INFO L225 Difference]: With dead ends: 340 [2022-07-21 06:20:39,431 INFO L226 Difference]: Without dead ends: 175 [2022-07-21 06:20:39,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:20:39,435 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:39,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:20:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-21 06:20:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-21 06:20:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-21 06:20:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2022-07-21 06:20:39,479 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2022-07-21 06:20:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2022-07-21 06:20:39,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2022-07-21 06:20:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 06:20:39,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:39,484 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:39,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 06:20:39,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2022-07-21 06:20:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:39,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063403588] [2022-07-21 06:20:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:20:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:20:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 06:20:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 06:20:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:20:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:20:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:20:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:20:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 06:20:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 06:20:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:20:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:39,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063403588] [2022-07-21 06:20:39,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063403588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:39,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:39,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:20:39,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192326507] [2022-07-21 06:20:39,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:39,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:20:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:20:39,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:20:39,720 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:39,749 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2022-07-21 06:20:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:20:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-21 06:20:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:39,752 INFO L225 Difference]: With dead ends: 343 [2022-07-21 06:20:39,752 INFO L226 Difference]: Without dead ends: 174 [2022-07-21 06:20:39,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:20:39,757 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:39,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:20:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-21 06:20:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-07-21 06:20:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-21 06:20:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2022-07-21 06:20:39,780 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2022-07-21 06:20:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:39,782 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2022-07-21 06:20:39,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2022-07-21 06:20:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 06:20:39,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:39,785 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:39,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 06:20:39,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2022-07-21 06:20:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:39,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370260732] [2022-07-21 06:20:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 06:20:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 06:20:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:20:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 06:20:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 06:20:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 06:20:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:20:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:20:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 06:20:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 06:20:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:20:39,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:39,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370260732] [2022-07-21 06:20:39,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370260732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:39,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813393919] [2022-07-21 06:20:39,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:39,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:39,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:39,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:39,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 06:20:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:40,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:20:40,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:20:40,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:20:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:20:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813393919] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:20:40,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:20:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-21 06:20:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034138208] [2022-07-21 06:20:40,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:20:40,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 06:20:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 06:20:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:20:40,650 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-21 06:20:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:40,686 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-07-21 06:20:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:20:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-21 06:20:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:40,688 INFO L225 Difference]: With dead ends: 347 [2022-07-21 06:20:40,688 INFO L226 Difference]: Without dead ends: 177 [2022-07-21 06:20:40,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:20:40,689 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:40,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:20:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-21 06:20:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-21 06:20:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-21 06:20:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2022-07-21 06:20:40,695 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2022-07-21 06:20:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:40,696 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2022-07-21 06:20:40,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-21 06:20:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-07-21 06:20:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-21 06:20:40,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:40,709 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:40,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 06:20:40,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:40,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2022-07-21 06:20:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063907373] [2022-07-21 06:20:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:20:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 06:20:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 06:20:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:20:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:20:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:20:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:20:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 06:20:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 06:20:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 06:20:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-21 06:20:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:41,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063907373] [2022-07-21 06:20:41,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063907373] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:41,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143315042] [2022-07-21 06:20:41,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:20:41,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:41,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:41,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 06:20:42,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:20:42,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:20:42,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 06:20:42,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 06:20:42,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:20:42,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143315042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:42,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:20:42,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-21 06:20:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283001381] [2022-07-21 06:20:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:42,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:20:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:42,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:20:42,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:20:42,150 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:42,210 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-07-21 06:20:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 06:20:42,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-21 06:20:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:42,214 INFO L225 Difference]: With dead ends: 339 [2022-07-21 06:20:42,217 INFO L226 Difference]: Without dead ends: 313 [2022-07-21 06:20:42,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:20:42,218 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 208 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:42,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1001 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:20:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-21 06:20:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-07-21 06:20:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-07-21 06:20:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2022-07-21 06:20:42,261 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2022-07-21 06:20:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:42,261 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2022-07-21 06:20:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:20:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2022-07-21 06:20:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-21 06:20:42,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:42,265 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:42,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 06:20:42,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:42,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2022-07-21 06:20:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:42,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800532549] [2022-07-21 06:20:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:20:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:20:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:20:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:20:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 06:20:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 06:20:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 06:20:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 06:20:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 06:20:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 06:20:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 06:20:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 06:20:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 06:20:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 06:20:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 06:20:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 06:20:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 06:20:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800532549] [2022-07-21 06:20:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800532549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005214072] [2022-07-21 06:20:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:42,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:42,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 06:20:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:43,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:20:43,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 06:20:43,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:20:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 06:20:43,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005214072] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:20:43,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:20:43,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-21 06:20:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052145900] [2022-07-21 06:20:43,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:20:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 06:20:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 06:20:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 06:20:43,735 INFO L87 Difference]: Start difference. First operand 312 states and 485 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-21 06:20:45,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:46,704 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2022-07-21 06:20:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 06:20:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2022-07-21 06:20:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:46,707 INFO L225 Difference]: With dead ends: 631 [2022-07-21 06:20:46,707 INFO L226 Difference]: Without dead ends: 331 [2022-07-21 06:20:46,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:20:46,709 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 227 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:46,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 611 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 315 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 06:20:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-21 06:20:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2022-07-21 06:20:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-21 06:20:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2022-07-21 06:20:46,753 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2022-07-21 06:20:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:46,753 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2022-07-21 06:20:46,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-21 06:20:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2022-07-21 06:20:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 06:20:46,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:46,768 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:46,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 06:20:46,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:46,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2022-07-21 06:20:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513463450] [2022-07-21 06:20:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:20:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:20:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:20:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:20:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 06:20:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 06:20:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:20:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 06:20:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 06:20:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 06:20:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 06:20:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 06:20:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 06:20:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 06:20:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 06:20:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 06:20:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 06:20:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-21 06:20:59,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:59,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513463450] [2022-07-21 06:20:59,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513463450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:59,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627126712] [2022-07-21 06:20:59,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:20:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:59,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:59,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 06:21:00,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:21:00,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:21:00,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:21:00,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-21 06:21:00,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:00,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627126712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:00,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:00,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 06:21:00,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662253756] [2022-07-21 06:21:00,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:00,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:21:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:00,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:21:00,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:21:00,788 INFO L87 Difference]: Start difference. First operand 325 states and 503 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-21 06:21:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:00,803 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2022-07-21 06:21:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:21:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 164 [2022-07-21 06:21:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:00,805 INFO L225 Difference]: With dead ends: 619 [2022-07-21 06:21:00,805 INFO L226 Difference]: Without dead ends: 325 [2022-07-21 06:21:00,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:21:00,806 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:00,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-21 06:21:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-07-21 06:21:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 211 states have internal predecessors, (294), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-21 06:21:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2022-07-21 06:21:00,819 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2022-07-21 06:21:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:00,819 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2022-07-21 06:21:00,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-21 06:21:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2022-07-21 06:21:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-21 06:21:00,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:00,822 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:00,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:01,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:01,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2022-07-21 06:21:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:01,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162426298] [2022-07-21 06:21:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:21:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:21:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 06:21:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 06:21:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 06:21:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 06:21:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 06:21:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 06:21:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 06:21:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 06:21:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 06:21:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:21:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 06:21:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 06:21:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-21 06:21:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162426298] [2022-07-21 06:21:01,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162426298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:01,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159151434] [2022-07-21 06:21:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:01,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:01,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:01,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 06:21:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:02,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 06:21:02,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:02,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-21 06:21:02,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 06:21:02,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 06:21:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-07-21 06:21:02,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:02,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-21 06:21:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-07-21 06:21:02,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159151434] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:02,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:02,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-21 06:21:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426740840] [2022-07-21 06:21:02,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:02,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 06:21:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 06:21:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-21 06:21:02,745 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-07-21 06:21:04,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:06,406 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2022-07-21 06:21:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 06:21:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 186 [2022-07-21 06:21:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:06,411 INFO L225 Difference]: With dead ends: 747 [2022-07-21 06:21:06,412 INFO L226 Difference]: Without dead ends: 717 [2022-07-21 06:21:06,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2022-07-21 06:21:06,417 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 1061 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1040 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:06,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1136 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1566 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-21 06:21:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-21 06:21:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2022-07-21 06:21:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 427 states have (on average 1.4285714285714286) internal successors, (610), 434 states have internal predecessors, (610), 211 states have call successors, (211), 32 states have call predecessors, (211), 41 states have return successors, (265), 213 states have call predecessors, (265), 211 states have call successors, (265) [2022-07-21 06:21:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2022-07-21 06:21:06,455 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2022-07-21 06:21:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:06,455 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2022-07-21 06:21:06,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-07-21 06:21:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2022-07-21 06:21:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-21 06:21:06,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:06,460 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:06,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 06:21:06,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:06,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 998047407, now seen corresponding path program 1 times [2022-07-21 06:21:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:06,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874910935] [2022-07-21 06:21:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 06:21:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:21:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:21:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 06:21:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 06:21:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 06:21:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 06:21:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 06:21:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 06:21:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 06:21:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 06:21:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 06:21:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 06:21:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 06:21:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 06:21:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-21 06:21:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874910935] [2022-07-21 06:21:07,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874910935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834436783] [2022-07-21 06:21:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:07,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:07,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 06:21:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:08,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:21:08,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:08,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 06:21:08,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 06:21:08,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 06:21:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-21 06:21:08,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:08,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834436783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:08,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:08,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 06:21:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470496642] [2022-07-21 06:21:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:08,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:21:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:21:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 06:21:08,144 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-21 06:21:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:08,240 INFO L93 Difference]: Finished difference Result 1342 states and 2141 transitions. [2022-07-21 06:21:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:21:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 187 [2022-07-21 06:21:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:08,244 INFO L225 Difference]: With dead ends: 1342 [2022-07-21 06:21:08,244 INFO L226 Difference]: Without dead ends: 696 [2022-07-21 06:21:08,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:21:08,247 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 272 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:08,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 904 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 06:21:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-07-21 06:21:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 686. [2022-07-21 06:21:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 431 states have (on average 1.4245939675174013) internal successors, (614), 440 states have internal predecessors, (614), 211 states have call successors, (211), 32 states have call predecessors, (211), 43 states have return successors, (268), 213 states have call predecessors, (268), 211 states have call successors, (268) [2022-07-21 06:21:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1093 transitions. [2022-07-21 06:21:08,275 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1093 transitions. Word has length 187 [2022-07-21 06:21:08,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:08,275 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1093 transitions. [2022-07-21 06:21:08,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-21 06:21:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1093 transitions. [2022-07-21 06:21:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-21 06:21:08,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:08,278 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:08,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:08,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:08,501 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1865108637, now seen corresponding path program 1 times [2022-07-21 06:21:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126398636] [2022-07-21 06:21:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:21:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:21:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 06:21:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 06:21:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 06:21:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 06:21:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 06:21:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 06:21:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 06:21:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 06:21:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 06:21:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:21:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 06:21:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 06:21:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2022-07-21 06:21:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:16,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126398636] [2022-07-21 06:21:16,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126398636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:16,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759925210] [2022-07-21 06:21:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:16,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:16,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 06:21:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:17,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 06:21:17,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 72 proven. 126 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-07-21 06:21:17,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-07-21 06:21:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759925210] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:17,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:17,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-21 06:21:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136059189] [2022-07-21 06:21:17,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:17,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 06:21:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 06:21:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-21 06:21:17,812 INFO L87 Difference]: Start difference. First operand 686 states and 1093 transitions. Second operand has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-21 06:21:19,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:21,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:23,169 INFO L93 Difference]: Finished difference Result 1956 states and 3237 transitions. [2022-07-21 06:21:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 06:21:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 186 [2022-07-21 06:21:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:23,170 INFO L225 Difference]: With dead ends: 1956 [2022-07-21 06:21:23,170 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 06:21:23,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 06:21:23,177 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 1023 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 1121 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 3870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1121 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:23,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1276 Invalid, 3870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1121 Valid, 2748 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 06:21:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 06:21:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 06:21:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:21:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 06:21:23,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2022-07-21 06:21:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:23,178 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 06:21:23,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-21 06:21:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 06:21:23,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 06:21:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 06:21:23,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:23,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:23,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 06:21:27,072 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-21 06:21:27,072 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-21 06:21:27,072 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-21 06:21:27,072 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-21 06:21:27,073 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2022-07-21 06:21:27,073 INFO L902 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2022-07-21 06:21:27,073 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2022-07-21 06:21:27,073 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2022-07-21 06:21:27,073 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_joinENTRY(lines 642 663) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,074 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2022-07-21 06:21:27,074 INFO L895 garLoopResultBuilder]: At program point L661(line 661) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,074 INFO L899 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2022-07-21 06:21:27,074 INFO L899 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2022-07-21 06:21:27,074 INFO L899 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2022-07-21 06:21:27,075 INFO L899 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2022-07-21 06:21:27,075 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2022-07-21 06:21:27,075 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_lockENTRY(lines 582 587) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,075 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2022-07-21 06:21:27,076 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2022-07-21 06:21:27,076 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2022-07-21 06:21:27,076 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2022-07-21 06:21:27,076 INFO L895 garLoopResultBuilder]: At program point L729(line 729) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,076 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,076 INFO L895 garLoopResultBuilder]: At program point L696(line 696) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2022-07-21 06:21:27,076 INFO L899 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2022-07-21 06:21:27,076 INFO L895 garLoopResultBuilder]: At program point L713(line 713) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,076 INFO L899 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,077 INFO L895 garLoopResultBuilder]: At program point L697(line 697) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2022-07-21 06:21:27,077 INFO L899 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,077 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,077 INFO L895 garLoopResultBuilder]: At program point L747(lines 743 751) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,077 INFO L895 garLoopResultBuilder]: At program point L714(line 714) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,077 INFO L899 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2022-07-21 06:21:27,077 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,077 INFO L895 garLoopResultBuilder]: At program point L731(line 731) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,077 INFO L899 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,077 INFO L895 garLoopResultBuilder]: At program point L698(line 698) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,078 INFO L899 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-07-21 06:21:27,078 INFO L895 garLoopResultBuilder]: At program point L715(line 715) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse1 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (.cse2 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (.cse3 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1 .cse2 .cse3) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (let ((.cse4 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 .cse1 (<= .cse4 ~__CS_ret_PREEMPTED~0) .cse2 .cse3 (<= ~__CS_ret_PREEMPTED~0 .cse4))))) [2022-07-21 06:21:27,078 INFO L899 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,078 INFO L895 garLoopResultBuilder]: At program point L699(line 699) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse1 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1) (not (= ~__CS_ret_PREEMPTED~0 1)) (let ((.cse2 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 .cse1 (<= .cse2 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse2))) (not (= (mod |old(~__CS_ret~0)| 256) 0)))) [2022-07-21 06:21:27,078 INFO L899 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,078 INFO L895 garLoopResultBuilder]: At program point L733(line 733) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,078 INFO L899 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,078 INFO L895 garLoopResultBuilder]: At program point L717(line 717) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,078 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,079 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,079 INFO L899 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-07-21 06:21:27,079 INFO L895 garLoopResultBuilder]: At program point L701(line 701) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,079 INFO L899 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,079 INFO L895 garLoopResultBuilder]: At program point L718(line 718) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,079 INFO L899 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2022-07-21 06:21:27,079 INFO L895 garLoopResultBuilder]: At program point L735(line 735) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-21 06:21:27,079 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,079 INFO L895 garLoopResultBuilder]: At program point L702(line 702) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,080 INFO L899 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2022-07-21 06:21:27,080 INFO L899 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,080 INFO L895 garLoopResultBuilder]: At program point L719(line 719) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,080 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,080 INFO L895 garLoopResultBuilder]: At program point L736(line 736) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-21 06:21:27,080 INFO L899 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2022-07-21 06:21:27,080 INFO L895 garLoopResultBuilder]: At program point L703(line 703) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2022-07-21 06:21:27,080 INFO L899 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,080 INFO L895 garLoopResultBuilder]: At program point L737(line 737) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-21 06:21:27,080 INFO L899 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,081 INFO L895 garLoopResultBuilder]: At program point L721(lines 721 753) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,081 INFO L895 garLoopResultBuilder]: At program point L738(line 738) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-21 06:21:27,081 INFO L899 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2022-07-21 06:21:27,081 INFO L895 garLoopResultBuilder]: At program point L705(lines 705 720) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,081 INFO L895 garLoopResultBuilder]: At program point L689(lines 689 704) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2022-07-21 06:21:27,082 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~$Pointer$ENTRY(line -1) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,082 INFO L895 garLoopResultBuilder]: At program point L739(line 739) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,082 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,082 INFO L895 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,082 INFO L899 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-07-21 06:21:27,082 INFO L895 garLoopResultBuilder]: At program point L707(line 707) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,082 INFO L899 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,082 INFO L895 garLoopResultBuilder]: At program point L691(line 691) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,082 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,083 INFO L895 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,084 INFO L899 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,084 INFO L895 garLoopResultBuilder]: At program point L708(line 708) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,084 INFO L899 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2022-07-21 06:21:27,084 INFO L895 garLoopResultBuilder]: At program point L725(line 725) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,084 INFO L899 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,084 INFO L895 garLoopResultBuilder]: At program point L692(line 692) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2022-07-21 06:21:27,084 INFO L899 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-07-21 06:21:27,084 INFO L899 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L895 garLoopResultBuilder]: At program point L709(line 709) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (let ((.cse2 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse3 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (.cse4 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (.cse5 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse3 .cse4 .cse5) .cse0 .cse1 (let ((.cse6 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 .cse3 (<= .cse6 ~__CS_ret_PREEMPTED~0) .cse4 .cse5 (<= ~__CS_ret_PREEMPTED~0 .cse6))))))) [2022-07-21 06:21:27,085 INFO L899 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L899 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L895 garLoopResultBuilder]: At program point L742-4(lines 742 751) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,085 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,085 INFO L899 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2022-07-21 06:21:27,085 INFO L895 garLoopResultBuilder]: At program point L693(line 693) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (let ((.cse2 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse3 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse3) .cse0 (let ((.cse4 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 .cse3 (<= .cse4 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse4))) .cse1)))) [2022-07-21 06:21:27,086 INFO L899 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,086 INFO L895 garLoopResultBuilder]: At program point L727(line 727) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,086 INFO L899 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2022-07-21 06:21:27,086 INFO L895 garLoopResultBuilder]: At program point L744(line 744) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,086 INFO L899 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2022-07-21 06:21:27,086 INFO L895 garLoopResultBuilder]: At program point L711(line 711) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,086 INFO L899 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2022-07-21 06:21:27,086 INFO L895 garLoopResultBuilder]: At program point L728(line 728) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,086 INFO L899 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2022-07-21 06:21:27,087 INFO L895 garLoopResultBuilder]: At program point L695(line 695) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2022-07-21 06:21:27,087 INFO L899 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2022-07-21 06:21:27,087 INFO L895 garLoopResultBuilder]: At program point L712(line 712) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-21 06:21:27,087 INFO L899 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2022-07-21 06:21:27,087 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_unlockENTRY(lines 588 596) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-21 06:21:27,087 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2022-07-21 06:21:27,087 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2022-07-21 06:21:27,087 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2022-07-21 06:21:27,087 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2022-07-21 06:21:27,088 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2022-07-21 06:21:27,088 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2022-07-21 06:21:27,088 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_createENTRY(lines 664 677) the Hoare annotation is: (or (not (= (mod ~__CS_ret~0 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1))) [2022-07-21 06:21:27,088 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2022-07-21 06:21:27,088 INFO L899 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L895 garLoopResultBuilder]: At program point L804(line 804) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2022-07-21 06:21:27,089 INFO L895 garLoopResultBuilder]: At program point L763-3(lines 763 772) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (= 0 (select ~__CS_thread~0.base 2)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-21 06:21:27,089 INFO L899 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2022-07-21 06:21:27,090 INFO L895 garLoopResultBuilder]: At program point L813(line 813) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,090 INFO L899 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2022-07-21 06:21:27,090 INFO L899 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-07-21 06:21:27,113 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2022-07-21 06:21:27,114 INFO L902 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2022-07-21 06:21:27,114 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2022-07-21 06:21:27,114 INFO L899 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2022-07-21 06:21:27,114 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,114 INFO L899 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2022-07-21 06:21:27,114 INFO L895 garLoopResultBuilder]: At program point L798(line 798) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-21 06:21:27,114 INFO L899 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L895 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L895 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L895 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2022-07-21 06:21:27,115 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L895 garLoopResultBuilder]: At program point L792(line 792) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_error~0 0) (= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0) (= 0 (select ~__CS_thread~0.base 2)) (= |#funAddr~main_thread.offset| (select ~__CS_thread~0.offset 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L895 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2022-07-21 06:21:27,116 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L895 garLoopResultBuilder]: At program point L768-3(lines 768 771) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= 0 (select ~__CS_thread~0.base 2)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-21 06:21:27,117 INFO L899 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,117 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-21 06:21:27,117 INFO L899 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L899 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L895 garLoopResultBuilder]: At program point __CS_csENTRY(lines 562 568) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-21 06:21:27,117 INFO L899 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-21 06:21:27,117 INFO L895 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-21 06:21:27,118 INFO L899 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2022-07-21 06:21:27,118 INFO L899 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2022-07-21 06:21:27,120 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:27,122 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 06:21:27,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-21 06:21:27,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-21 06:21:27,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 06:21:27 BoogieIcfgContainer [2022-07-21 06:21:27,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 06:21:27,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 06:21:27,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 06:21:27,140 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 06:21:27,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:20:37" (3/4) ... [2022-07-21 06:21:27,148 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 06:21:27,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2022-07-21 06:21:27,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2022-07-21 06:21:27,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:21:27,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2022-07-21 06:21:27,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2022-07-21 06:21:27,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 06:21:27,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2022-07-21 06:21:27,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2022-07-21 06:21:27,161 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-07-21 06:21:27,162 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-21 06:21:27,162 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-21 06:21:27,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-21 06:21:27,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) && #funAddr~thread2.offset == #fp) && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) [2022-07-21 06:21:27,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_ret) % 256 == 0)) || (\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) [2022-07-21 06:21:27,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_ret % 256 == 0 && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) [2022-07-21 06:21:27,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2022-07-21 06:21:27,221 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 06:21:27,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 06:21:27,224 INFO L158 Benchmark]: Toolchain (without parser) took 53369.98ms. Allocated memory was 54.5MB in the beginning and 828.4MB in the end (delta: 773.8MB). Free memory was 35.3MB in the beginning and 726.2MB in the end (delta: -690.9MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,224 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 44.0MB. Free memory was 26.0MB in the beginning and 25.9MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 06:21:27,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 869.12ms. Allocated memory is still 54.5MB. Free memory was 35.0MB in the beginning and 34.6MB in the end (delta: 392.6kB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.69ms. Allocated memory is still 54.5MB. Free memory was 34.6MB in the beginning and 30.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,225 INFO L158 Benchmark]: Boogie Preprocessor took 107.08ms. Allocated memory is still 54.5MB. Free memory was 30.5MB in the beginning and 26.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,226 INFO L158 Benchmark]: RCFGBuilder took 2776.42ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 26.8MB in the beginning and 30.0MB in the end (delta: -3.2MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,226 INFO L158 Benchmark]: TraceAbstraction took 49398.27ms. Allocated memory was 67.1MB in the beginning and 828.4MB in the end (delta: 761.3MB). Free memory was 29.4MB in the beginning and 736.7MB in the end (delta: -707.2MB). Peak memory consumption was 554.6MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,226 INFO L158 Benchmark]: Witness Printer took 83.94ms. Allocated memory is still 828.4MB. Free memory was 736.7MB in the beginning and 726.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 06:21:27,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 44.0MB. Free memory was 26.0MB in the beginning and 25.9MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 869.12ms. Allocated memory is still 54.5MB. Free memory was 35.0MB in the beginning and 34.6MB in the end (delta: 392.6kB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.69ms. Allocated memory is still 54.5MB. Free memory was 34.6MB in the beginning and 30.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.08ms. Allocated memory is still 54.5MB. Free memory was 30.5MB in the beginning and 26.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2776.42ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 26.8MB in the beginning and 30.0MB in the end (delta: -3.2MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 49398.27ms. Allocated memory was 67.1MB in the beginning and 828.4MB in the end (delta: 761.3MB). Free memory was 29.4MB in the beginning and 736.7MB in the end (delta: -707.2MB). Peak memory consumption was 554.6MB. Max. memory is 16.1GB. * Witness Printer took 83.94ms. Allocated memory is still 828.4MB. Free memory was 736.7MB in the beginning and 726.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 542]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 175 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.3s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2712 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2672 mSDsluCounter, 7253 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4486 mSDsCounter, 2411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4694 IncrementalHoareTripleChecker+Invalid, 7108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2411 mSolverCounterUnsat, 2767 mSDtfsCounter, 4694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2065 GetRequests, 1961 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3660 PreInvPairs, 5194 NumberOfFragments, 1920 HoareAnnotationTreeSize, 3660 FomulaSimplifications, 8468 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 69 FomulaSimplificationsInter, 27766 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 22.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2291 NumberOfCodeBlocks, 2087 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2874 ConstructedInterpolants, 0 QuantifiedInterpolants, 5735 SizeOfPredicates, 16 NumberOfNonLiveVariables, 14366 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 7782/7959 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 689]: Loop Invariant [2022-07-21 06:21:27,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_ret) % 256 == 0)) || (\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) - InvariantResult [Line: 768]: Loop Invariant [2022-07-21 06:21:27,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: ((((__CS_ret % 256 == 0 && __CS_ret_PREEMPTED == 1) && __CS_error == 0) && i <= 1) && 0 == __CS_thread[2]) && __CS_thread[2] == 0 - InvariantResult [Line: 763]: Loop Invariant [2022-07-21 06:21:27,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: (((__CS_ret % 256 == 0 && __CS_ret_PREEMPTED == 1) && __CS_error == 0) && 0 == __CS_thread[2]) && __CS_thread[2] == 0 - InvariantResult [Line: 705]: Loop Invariant [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-21 06:21:27,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-21 06:21:27,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset Derived loop invariant: ((((\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) && #funAddr~thread2.offset == #fp) && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((__CS_ret % 256 == 0 && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-21 06:21:27,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE