./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-04 12:05:38,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-04 12:05:38,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-04 12:05:38,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-04 12:05:38,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-04 12:05:38,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-04 12:05:38,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-04 12:05:38,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-04 12:05:38,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-04 12:05:38,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-04 12:05:38,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-04 12:05:38,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-04 12:05:38,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-04 12:05:38,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-04 12:05:38,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-04 12:05:38,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-04 12:05:38,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-04 12:05:38,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-04 12:05:38,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-04 12:05:38,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-04 12:05:38,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-04 12:05:38,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-04 12:05:38,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-04 12:05:38,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-04 12:05:38,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-04 12:05:38,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-04 12:05:38,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-04 12:05:38,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-04 12:05:38,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-04 12:05:38,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-04 12:05:38,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-04 12:05:38,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-04 12:05:38,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-04 12:05:38,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-04 12:05:38,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-04 12:05:38,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-04 12:05:38,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-04 12:05:38,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-04 12:05:38,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-04 12:05:38,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-04 12:05:38,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-04 12:05:38,241 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-04 12:05:38,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-04 12:05:38,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-04 12:05:38,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-04 12:05:38,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-04 12:05:38,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-04 12:05:38,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-04 12:05:38,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-04 12:05:38,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-04 12:05:38,294 INFO L138 SettingsManager]: * Use SBE=true [2022-11-04 12:05:38,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-04 12:05:38,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-04 12:05:38,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-04 12:05:38,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-04 12:05:38,297 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-04 12:05:38,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-04 12:05:38,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-04 12:05:38,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-04 12:05:38,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-04 12:05:38,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-04 12:05:38,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:05:38,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-04 12:05:38,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-04 12:05:38,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-04 12:05:38,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-04 12:05:38,300 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-04 12:05:38,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-04 12:05:38,301 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-04 12:05:38,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-04 12:05:38,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-04 12:05:38,301 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-04 12:05:38,301 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-04 12:05:38,302 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi 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 -> GemCutter 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2022-11-04 12:05:38,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-04 12:05:38,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-04 12:05:38,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-04 12:05:38,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-04 12:05:38,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-04 12:05:38,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-11-04 12:05:38,747 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/data/adfe2d809/114e8ce1fb2f43ad8269f7a9749c1921/FLAGeabdb2aa5 [2022-11-04 12:05:39,445 INFO L306 CDTParser]: Found 1 translation units. [2022-11-04 12:05:39,446 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-11-04 12:05:39,465 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/data/adfe2d809/114e8ce1fb2f43ad8269f7a9749c1921/FLAGeabdb2aa5 [2022-11-04 12:05:39,646 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/data/adfe2d809/114e8ce1fb2f43ad8269f7a9749c1921 [2022-11-04 12:05:39,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-04 12:05:39,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-04 12:05:39,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-04 12:05:39,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-04 12:05:39,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-04 12:05:39,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:05:39" (1/1) ... [2022-11-04 12:05:39,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc928f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:39, skipping insertion in model container [2022-11-04 12:05:39,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:05:39" (1/1) ... [2022-11-04 12:05:39,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-04 12:05:39,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-04 12:05:40,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-11-04 12:05:40,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:05:40,345 INFO L203 MainTranslator]: Completed pre-run [2022-11-04 12:05:40,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-11-04 12:05:40,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:05:40,492 INFO L208 MainTranslator]: Completed translation [2022-11-04 12:05:40,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40 WrapperNode [2022-11-04 12:05:40,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-04 12:05:40,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-04 12:05:40,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-04 12:05:40,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-04 12:05:40,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,576 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-11-04 12:05:40,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-04 12:05:40,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-04 12:05:40,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-04 12:05:40,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-04 12:05:40,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,630 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-04 12:05:40,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-04 12:05:40,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-04 12:05:40,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-04 12:05:40,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (1/1) ... [2022-11-04 12:05:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:05:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:40,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:40,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-04 12:05:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-04 12:05:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-04 12:05:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-04 12:05:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-04 12:05:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-04 12:05:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-04 12:05:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-04 12:05:40,737 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-04 12:05:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-04 12:05:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-04 12:05:40,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-04 12:05:40,739 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-04 12:05:40,961 INFO L235 CfgBuilder]: Building ICFG [2022-11-04 12:05:40,964 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-04 12:05:41,268 INFO L276 CfgBuilder]: Performing block encoding [2022-11-04 12:05:41,288 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-04 12:05:41,288 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2022-11-04 12:05:41,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:05:41 BoogieIcfgContainer [2022-11-04 12:05:41,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-04 12:05:41,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-04 12:05:41,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-04 12:05:41,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-04 12:05:41,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:05:39" (1/3) ... [2022-11-04 12:05:41,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ede9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:05:41, skipping insertion in model container [2022-11-04 12:05:41,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:40" (2/3) ... [2022-11-04 12:05:41,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ede9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:05:41, skipping insertion in model container [2022-11-04 12:05:41,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:05:41" (3/3) ... [2022-11-04 12:05:41,299 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-11-04 12:05:41,308 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-04 12:05:41,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-04 12:05:41,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-04 12:05:41,342 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-04 12:05:41,488 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-04 12:05:41,555 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:41,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:05:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:41,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:41,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-04 12:05:41,596 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:05:41,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-04 12:05:41,618 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=PARTIAL_ORDER_FA, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@bd82e13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:41,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-04 12:05:41,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash -217069186, now seen corresponding path program 1 times [2022-11-04 12:05:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:41,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726005305] [2022-11-04 12:05:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-04 12:05:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:42,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726005305] [2022-11-04 12:05:42,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726005305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:42,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:42,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:42,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506517119] [2022-11-04 12:05:42,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:42,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:05:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:05:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:05:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,221 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:42,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 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-11-04 12:05:42,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-04 12:05:42,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 149425248, now seen corresponding path program 1 times [2022-11-04 12:05:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:42,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028088860] [2022-11-04 12:05:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-04 12:05:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:42,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028088860] [2022-11-04 12:05:42,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028088860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:42,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:42,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-04 12:05:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589266283] [2022-11-04 12:05:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:42,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-04 12:05:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:42,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-11-04 12:05:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:42,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-04 12:05:42,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash -52832125, now seen corresponding path program 1 times [2022-11-04 12:05:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:42,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563846316] [2022-11-04 12:05:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-04 12:05:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563846316] [2022-11-04 12:05:42,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563846316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:05:42,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569677393] [2022-11-04 12:05:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:42,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:05:42,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-04 12:05:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:43,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-04 12:05:43,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:05:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-04 12:05:43,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-04 12:05:43,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569677393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:43,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-04 12:05:43,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-04 12:05:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86508659] [2022-11-04 12:05:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:43,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:43,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:43,201 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:43,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-04 12:05:43,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:43,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:43,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:43,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-04 12:05:43,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:43,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1511525367, now seen corresponding path program 1 times [2022-11-04 12:05:43,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:43,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882822543] [2022-11-04 12:05:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-04 12:05:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:43,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882822543] [2022-11-04 12:05:43,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882822543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:05:43,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306652727] [2022-11-04 12:05:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:43,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:05:43,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-04 12:05:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:44,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-04 12:05:44,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:05:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-04 12:05:44,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-04 12:05:44,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306652727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:44,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-04 12:05:44,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-04 12:05:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546966158] [2022-11-04 12:05:44,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:44,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:44,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:44,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,132 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:44,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-11-04 12:05:44,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-04 12:05:44,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-04 12:05:44,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -493151866, now seen corresponding path program 1 times [2022-11-04 12:05:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:44,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937026996] [2022-11-04 12:05:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-04 12:05:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:44,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937026996] [2022-11-04 12:05:44,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937026996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:05:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588652373] [2022-11-04 12:05:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:44,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:05:44,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-04 12:05:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:44,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-04 12:05:44,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:05:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-04 12:05:44,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:05:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-04 12:05:44,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588652373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:05:44,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:05:44,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-04 12:05:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218483416] [2022-11-04 12:05:44,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:05:44,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-04 12:05:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-04 12:05:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-04 12:05:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:44,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 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-11-04 12:05:44,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:44,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:44,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:45,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-04 12:05:45,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:45,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:45,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:45,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1009342310, now seen corresponding path program 2 times [2022-11-04 12:05:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:45,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210103118] [2022-11-04 12:05:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:45,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-04 12:05:45,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210103118] [2022-11-04 12:05:45,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210103118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:05:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896519318] [2022-11-04 12:05:45,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:05:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:45,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:05:45,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-04 12:05:45,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:05:45,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:05:45,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-04 12:05:45,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:05:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-04 12:05:45,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:05:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-04 12:05:45,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896519318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:05:45,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:05:45,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-11-04 12:05:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798888259] [2022-11-04 12:05:45,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:05:45,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-04 12:05:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-04 12:05:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-11-04 12:05:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:45,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 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-11-04 12:05:45,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:45,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:45,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:45,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:45,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:05:46,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-04 12:05:46,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:46,533 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1626594875, now seen corresponding path program 1 times [2022-11-04 12:05:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:46,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052389961] [2022-11-04 12:05:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:46,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:46,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052389961] [2022-11-04 12:05:46,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052389961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:05:46,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350389156] [2022-11-04 12:05:46,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:46,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:46,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:05:46,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-04 12:05:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:47,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-04 12:05:47,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:05:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:47,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:05:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:47,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350389156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:05:47,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:05:47,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-04 12:05:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462820135] [2022-11-04 12:05:47,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:05:47,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-04 12:05:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-04 12:05:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-04 12:05:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:47,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:47,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 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-11-04 12:05:47,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:47,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:47,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:47,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:47,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:47,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:05:47,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:05:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:05:47,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-04 12:05:48,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:48,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash -176063262, now seen corresponding path program 2 times [2022-11-04 12:05:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:48,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431935054] [2022-11-04 12:05:48,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:48,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:05:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:49,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431935054] [2022-11-04 12:05:49,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431935054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:05:49,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100344700] [2022-11-04 12:05:49,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:05:49,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:49,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:05:49,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-04 12:05:49,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:05:49,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:05:49,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-04 12:05:49,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:05:49,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-11-04 12:05:49,767 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:05:49,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:05:49,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 15 [2022-11-04 12:05:49,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 15 [2022-11-04 12:05:50,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-11-04 12:05:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:05:50,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:05:52,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_587 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_587) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:05:52,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_587 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_587) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:05:52,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_587 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_587) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:05:52,991 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 9 treesize of output 7 [2022-11-04 12:05:53,025 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-04 12:05:53,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-04 12:05:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2022-11-04 12:05:53,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100344700] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:05:53,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:05:53,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 29 [2022-11-04 12:05:53,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627752806] [2022-11-04 12:05:53,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:05:53,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-04 12:05:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:53,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-04 12:05:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=562, Unknown=4, NotChecked=150, Total=812 [2022-11-04 12:05:53,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:53,049 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:53,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 29 states have internal predecessors, (175), 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-11-04 12:05:53,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:53,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:53,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:05:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:05:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:05:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:05:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-04 12:05:55,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-04 12:05:55,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:05:55,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:05:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash -880611281, now seen corresponding path program 1 times [2022-11-04 12:05:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:55,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952503211] [2022-11-04 12:05:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:06:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952503211] [2022-11-04 12:06:00,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952503211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035596691] [2022-11-04 12:06:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:00,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:00,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-04 12:06:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:00,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-04 12:06:00,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:00,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-11-04 12:06:00,815 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:06:00,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:06:00,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 15 [2022-11-04 12:06:01,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 15 [2022-11-04 12:06:01,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-11-04 12:06:01,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2022-11-04 12:06:01,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2022-11-04 12:06:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:06:01,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:08,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-11-04 12:06:10,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-11-04 12:06:12,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-11-04 12:06:12,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-11-04 12:06:14,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-11-04 12:06:14,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_684 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_684) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:06:15,394 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 9 treesize of output 7 [2022-11-04 12:06:15,458 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-04 12:06:15,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-04 12:06:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 239 trivial. 8 not checked. [2022-11-04 12:06:15,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035596691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:06:15,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:06:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 17] total 50 [2022-11-04 12:06:15,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940224916] [2022-11-04 12:06:15,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:06:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-04 12:06:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-04 12:06:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1711, Unknown=8, NotChecked=534, Total=2450 [2022-11-04 12:06:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:15,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:15,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.46) internal successors, (273), 50 states have internal predecessors, (273), 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-11-04 12:06:15,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:15,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:15,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:15,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:15,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:15,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:06:15,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:06:15,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-04 12:06:15,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:35,700 WARN L234 SmtUtils]: Spent 18.29s on a formula simplification. DAG size of input: 64 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:06:41,004 WARN L234 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 42 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:06:41,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse5 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse5 .cse0))) (let ((.cse1 (store .cse5 .cse4 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= .cse0 (store .cse1 .cse2 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (or (= .cse0 .cse1) (<= .cse2 4)) (or (<= .cse4 4) (= .cse0 .cse5)) (= |c_~#cache~0.base| 4))))))) is different from false [2022-11-04 12:06:42,342 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse5 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse5 .cse0))) (let ((.cse1 (store .cse5 .cse4 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= .cse0 (store .cse1 .cse2 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse0 .cse1) (<= .cse2 4)) (or (<= .cse4 4) (= .cse0 .cse5)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4))))))) is different from false [2022-11-04 12:06:42,917 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse5 (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse5 .cse0))) (let ((.cse2 (store .cse5 .cse4 0))) (let ((.cse3 (@diff .cse2 .cse0))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (= .cse0 (store .cse2 .cse3 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse0 .cse2) (<= .cse3 4)) (or (<= .cse4 4) (= .cse0 .cse5)) (= |c_~#cache~0.base| 4))))))) is different from false [2022-11-04 12:06:50,617 WARN L234 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 32 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:06:51,090 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-11-04 12:06:51,526 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4))) is different from false [2022-11-04 12:06:51,960 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (= |c_~#cache~0.base| 4))) is different from false [2022-11-04 12:06:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:06:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:06:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-04 12:06:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-04 12:06:57,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-04 12:06:57,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:57,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1651085733, now seen corresponding path program 1 times [2022-11-04 12:06:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:57,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060412425] [2022-11-04 12:06:57,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:07:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 7 proven. 100 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:07:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:07:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060412425] [2022-11-04 12:07:16,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060412425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:07:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073764809] [2022-11-04 12:07:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:07:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:07:16,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:07:16,442 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:07:16,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-04 12:07:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:07:16,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-04 12:07:16,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:07:16,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-11-04 12:07:17,139 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:07:17,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:07:17,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 15 [2022-11-04 12:07:17,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 15 [2022-11-04 12:07:17,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-04 12:07:18,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2022-11-04 12:07:45,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-04 12:07:57,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 19 [2022-11-04 12:11:04,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2022-11-04 12:11:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 13 proven. 62 refuted. 32 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:11:04,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:11:11,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2022-11-04 12:11:13,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-04 12:11:15,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2022-11-04 12:11:17,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2022-11-04 12:11:19,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2022-11-04 12:11:21,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2022-11-04 12:11:23,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) is different from false [2022-11-04 12:11:25,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_39|)))) is different from false [2022-11-04 12:11:27,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-11-04 12:11:29,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_836 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) is different from false [2022-11-04 12:11:29,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_833 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_836 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_833))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-11-04 12:11:29,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_833 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_836 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_833))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_836))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) is different from false [2022-11-04 12:11:29,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_833 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_836 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_833) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_836) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84)))) is different from false [2022-11-04 12:11:31,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:11:31,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:11:31,285 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 9 treesize of output 7 [2022-11-04 12:11:31,365 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-04 12:11:31,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-04 12:11:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 107 not checked. [2022-11-04 12:11:31,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073764809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:11:31,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:11:31,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 24] total 70 [2022-11-04 12:11:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531389071] [2022-11-04 12:11:31,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:11:31,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-04 12:11:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:11:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-04 12:11:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2815, Unknown=141, NotChecked=1586, Total=4830 [2022-11-04 12:11:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:11:31,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:11:31,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 6.571428571428571) internal successors, (460), 70 states have internal predecessors, (460), 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-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-04 12:11:31,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:12:31,757 WARN L234 SmtUtils]: Spent 10.47s on a formula simplification. DAG size of input: 76 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:12:49,407 WARN L234 SmtUtils]: Spent 13.45s on a formula simplification. DAG size of input: 96 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:13:05,529 WARN L234 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 123 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:14:17,963 WARN L234 SmtUtils]: Spent 19.61s on a formula simplification. DAG size of input: 71 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:14:47,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse3 (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2))) (let ((.cse14 (store .cse3 .cse4 0))) (let ((.cse15 (@diff .cse14 .cse2))) (let ((.cse10 (store .cse14 .cse15 0))) (let ((.cse16 (@diff .cse1 .cse2)) (.cse11 (@diff .cse10 .cse2))) (let ((.cse12 (store .cse10 .cse11 0)) (.cse6 (store .cse1 .cse16 0)) (.cse5 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse8 (+ .cse5 |c_~#cache~0.offset|)) (.cse7 (@diff .cse6 .cse2)) (.cse9 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse13 (@diff .cse12 .cse2))) (and (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_836 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) (or (= .cse2 .cse3) (<= (+ .cse4 24) .cse5)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (or (= .cse2 .cse6) (<= .cse7 4)) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_838 Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse8) (= (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_838) .cse9))) (or (= .cse2 .cse10) (<= (+ .cse11 24) .cse5)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (= |c_~#cache~0.offset| 0) (or (= .cse2 .cse12) (<= (+ .cse13 24) .cse5)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse2 (store .cse6 .cse7 0)) (exists ((v_ArrVal_834 Int)) (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_834) .cse9)) (= .cse2 (store .cse12 .cse13 0)) (or (= .cse2 .cse14) (<= (+ .cse15 24) .cse5)) (or (= .cse2 .cse1) (<= .cse16 4)) (= |c_~#cache~0.base| 4))))))))))) is different from false [2022-11-04 12:14:49,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse15 (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse15 .cse7))) (let ((.cse14 (store .cse15 .cse3 0))) (let ((.cse13 (@diff .cse14 .cse7))) (let ((.cse16 (store .cse14 .cse13 0))) (let ((.cse9 (@diff .cse16 .cse7))) (let ((.cse10 (store .cse16 .cse9 0)) (.cse4 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse5 (= .cse7 .cse16)) (.cse6 (+ .cse4 |c_~#cache~0.offset|)) (.cse8 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse11 (@diff .cse10 .cse7)) (.cse2 (= .cse7 .cse15)) (.cse12 (= .cse7 .cse14))) (and (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_836 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) (or .cse2 (<= (+ .cse3 24) .cse4)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_838 Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse6) (= (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_838) .cse8))) (or .cse5 (<= (+ .cse9 24) .cse4)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (or (= .cse7 .cse10) (<= (+ .cse11 24) .cse4)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_834 Int)) (= (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_834) .cse8)) (or .cse12 (<= .cse13 4)) (= .cse7 (store .cse10 .cse11 0)) (or (<= .cse3 4) .cse2) (or .cse12 (<= (+ .cse13 24) .cse4)) (= |c_~#cache~0.base| 4))))))))))) is different from false [2022-11-04 12:14:50,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse14 .cse2))) (let ((.cse13 (store .cse14 .cse4 0))) (let ((.cse12 (@diff .cse13 .cse2))) (let ((.cse15 (store .cse13 .cse12 0))) (let ((.cse8 (@diff .cse15 .cse2))) (let ((.cse9 (store .cse15 .cse8 0)) (.cse5 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse7 (= .cse2 .cse15)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (+ .cse5 |c_~#cache~0.offset|)) (.cse10 (@diff .cse9 .cse2)) (.cse3 (= .cse2 .cse14)) (.cse11 (= .cse2 .cse13))) (and (exists ((v_ArrVal_841 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse0) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (or .cse3 (<= (+ .cse4 24) .cse5)) (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse6 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse6 |c_~#cache~0.offset|)) (< (+ .cse6 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 (or .cse7 (<= (+ .cse8 24) .cse5)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_836 Int)) (and (= (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836) .cse1) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (or (= .cse2 .cse9) (<= (+ .cse10 24) .cse5)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse11 (<= .cse12 4)) (= .cse2 (store .cse9 .cse10 0)) (or (<= .cse4 4) .cse3) (or .cse11 (<= (+ .cse12 24) .cse5)) (= |c_~#cache~0.base| 4)))))))))) is different from false [2022-11-04 12:14:52,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse2))) (let ((.cse16 (store .cse1 .cse4 0))) (let ((.cse15 (@diff .cse16 .cse2))) (let ((.cse17 (store .cse16 .cse15 0))) (let ((.cse13 (@diff .cse17 .cse2))) (let ((.cse18 (store .cse17 .cse13 0))) (let ((.cse10 (@diff .cse18 .cse2))) (let ((.cse19 (store .cse18 .cse10 0))) (let ((.cse9 (@diff .cse19 .cse2))) (let ((.cse6 (store .cse19 .cse9 0))) (let ((.cse7 (@diff .cse6 .cse2)) (.cse8 (= .cse2 .cse19)) (.cse11 (= .cse2 .cse18)) (.cse12 (= .cse2 .cse17)) (.cse5 (= .cse2 .cse1)) (.cse14 (= .cse2 .cse16)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (exists ((v_ArrVal_841 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse0) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse3 |c_~#cache~0.offset|)) (< (+ .cse3 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) (or (<= .cse4 .cse0) .cse5) (= .cse2 (store .cse6 .cse7 0)) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_836 Int)) (and (= (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836) .cse1) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse8 (<= .cse9 .cse0)) (or (= .cse2 .cse6) (<= .cse7 .cse0)) (or (<= .cse10 .cse0) .cse11) (or .cse12 (<= .cse13 .cse0)) (= |c_~#cache~0.base| 4) (or (and (or .cse14 (<= .cse15 4)) .cse8 (or (<= .cse10 4) .cse11) (or (<= .cse13 4) .cse12) (<= .cse4 4)) .cse5) (or .cse14 (<= .cse15 .cse0))))))))))))))) is different from false [2022-11-04 12:14:54,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse3 .cse4))) (let ((.cse22 (store .cse3 .cse1 0))) (let ((.cse6 (@diff .cse22 .cse4))) (let ((.cse21 (store .cse22 .cse6 0))) (let ((.cse19 (@diff .cse21 .cse4))) (let ((.cse23 (store .cse21 .cse19 0))) (let ((.cse8 (@diff .cse23 .cse4))) (let ((.cse18 (store .cse23 .cse8 0))) (let ((.cse9 (= .cse4 .cse23)) (.cse7 (= .cse4 .cse18)) (.cse5 (= .cse4 .cse22)) (.cse0 (= .cse4 .cse3)) (.cse2 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse13 (= .cse4 .cse21))) (and (or .cse0 (<= .cse1 4)) (= |c_t_funThread1of1ForFork0_#t~post41#1| 0) (exists ((v_ArrVal_841 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse2) (= .cse3 (store (store .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2))) (or .cse5 (<= .cse6 4)) .cse7 (or (<= .cse8 4) .cse9) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_836 Int)) (and (= (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836) .cse3) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2))) (let ((.cse14 (<= .cse1 .cse2)) (.cse12 (<= .cse19 .cse2)) (.cse10 (<= .cse8 .cse2)) (.cse11 (<= .cse6 .cse2))) (or (and (or .cse10 .cse9) .cse7 (or .cse5 .cse11) (or .cse12 .cse13) (or .cse14 .cse0)) (let ((.cse17 (@diff .cse18 .cse4))) (let ((.cse15 (store .cse18 .cse17 0))) (let ((.cse16 (@diff .cse15 .cse4))) (and (or (= .cse4 .cse15) (<= .cse16 .cse2)) .cse14 .cse12 (<= .cse17 .cse2) (= .cse4 (store .cse15 .cse16 0)) .cse10 .cse11)))))) (or (<= .cse19 4) .cse13) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (let ((.cse20 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse20 |c_~#cache~0.offset|)) (< (+ .cse20 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_39|)))) (= |c_~#cache~0.base| 4)))))))))))) is different from false [2022-11-04 12:14:55,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse11 .cse10))) (let ((.cse23 (store .cse11 .cse1 0))) (let ((.cse8 (@diff .cse23 .cse10))) (let ((.cse22 (store .cse23 .cse8 0))) (let ((.cse6 (@diff .cse22 .cse10))) (let ((.cse21 (store .cse22 .cse6 0))) (let ((.cse4 (@diff .cse21 .cse10))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse20 (store .cse21 .cse4 0))) (let ((.cse7 (= .cse10 .cse20)) (.cse9 (= .cse10 .cse23)) (.cse5 (= .cse10 .cse22)) (.cse3 (= .cse10 .cse21)) (.cse0 (= .cse10 .cse11)) (.cse12 (+ .cse2 |c_~#cache~0.offset|))) (and (or .cse0 (and (<= (+ .cse1 24) .cse2) (or .cse3 (<= (+ .cse4 24) .cse2)) (or .cse5 (<= (+ .cse6 24) .cse2)) .cse7 (or (<= (+ .cse8 24) .cse2) .cse9))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_836 Int)) (and (= (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836) .cse11) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse12))) (exists ((v_ArrVal_841 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) .cse12) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse12) (= .cse11 (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)))) (let ((.cse14 (<= (+ .cse6 28) .cse12)) (.cse15 (<= (+ .cse4 28) .cse12)) (.cse16 (<= (+ 28 .cse1) .cse12)) (.cse13 (<= (+ .cse8 28) .cse12))) (or (and .cse7 (or .cse9 .cse13) (or .cse14 .cse5) (or .cse15 .cse3) (or .cse0 .cse16)) (let ((.cse17 (@diff .cse20 .cse10))) (let ((.cse18 (store .cse20 .cse17 0))) (let ((.cse19 (@diff .cse18 .cse10))) (and (<= (+ .cse17 28) .cse12) .cse14 .cse15 (= .cse10 (store .cse18 .cse19 0)) (or (= .cse10 .cse18) (<= (+ .cse19 28) .cse12)) .cse16 .cse13)))))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse2 |c_~#cache~0.offset|)) (< .cse12 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (= (select (store .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) (= |c_~#cache~0.base| 4)))))))))))) is different from false [2022-11-04 12:14:57,814 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (@diff .cse3 .cse2))) (let ((.cse24 (store .cse3 .cse0 0))) (let ((.cse23 (@diff .cse24 .cse2))) (let ((.cse25 (store .cse24 .cse23 0))) (let ((.cse26 (@diff .cse25 .cse2))) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse4 (store .cse25 .cse26 0))) (let ((.cse5 (@diff .cse4 .cse2)) (.cse6 (+ .cse1 |c_~#cache~0.offset|)) (.cse7 (select |c_#memory_int| |c_~#cache~0.base|))) (and (or (<= (+ .cse0 24) .cse1) (= .cse2 .cse3)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= .cse2 (store .cse4 .cse5 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse6) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_836 Int)) (and (= (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_836) .cse7) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6))) (or (<= (+ .cse5 24) .cse1) (= .cse4 .cse2)) (exists ((v_ArrVal_841 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) .cse6) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= .cse7 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)))) (let ((.cse21 (@diff .cse7 .cse2))) (let ((.cse9 (store .cse7 .cse21 0))) (let ((.cse20 (@diff .cse9 .cse2))) (let ((.cse12 (store .cse9 .cse20 0))) (let ((.cse22 (@diff .cse12 .cse2))) (let ((.cse14 (store .cse12 .cse22 0))) (let ((.cse19 (@diff .cse14 .cse2))) (let ((.cse11 (<= (+ .cse22 28) .cse6)) (.cse13 (<= (+ .cse19 28) .cse6)) (.cse15 (<= (+ 28 .cse21) .cse6)) (.cse10 (<= (+ .cse20 28) .cse6)) (.cse8 (store .cse14 .cse19 0))) (or (and (= .cse2 .cse8) (or (= .cse2 .cse9) .cse10) (or .cse11 (= .cse2 .cse12)) (or .cse13 (= .cse2 .cse14)) (or (= .cse2 .cse7) .cse15)) (let ((.cse16 (@diff .cse8 .cse2))) (let ((.cse17 (store .cse8 .cse16 0))) (let ((.cse18 (@diff .cse17 .cse2))) (and (<= (+ .cse16 28) .cse6) .cse11 .cse13 (= .cse2 (store .cse17 .cse18 0)) (or (= .cse2 .cse17) (<= (+ .cse18 28) .cse6)) .cse15 .cse10))))))))))))) (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_841)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse1 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (or (<= (+ .cse23 24) .cse1) (= .cse2 .cse24)) (= |c_~#cache~0.base| 4) (or (= .cse25 .cse2) (<= (+ .cse26 24) .cse1))))))))))) is different from false [2022-11-04 12:14:59,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse4 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 (+ .cse0 |c_~#cache~0.offset|)) (.cse2 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 ((as const (Array Int Int)) 0))) (and (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) .cse2 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse3) (= .cse4 (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836)))) (exists ((v_ArrVal_841 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) .cse3) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (= .cse4 (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)))) (let ((.cse19 (@diff .cse4 .cse5))) (let ((.cse7 (store .cse4 .cse19 0))) (let ((.cse18 (@diff .cse7 .cse5))) (let ((.cse10 (store .cse7 .cse18 0))) (let ((.cse20 (@diff .cse10 .cse5))) (let ((.cse12 (store .cse10 .cse20 0))) (let ((.cse17 (@diff .cse12 .cse5))) (let ((.cse9 (<= (+ .cse20 28) .cse3)) (.cse11 (<= (+ .cse17 28) .cse3)) (.cse13 (<= (+ 28 .cse19) .cse3)) (.cse8 (<= (+ .cse18 28) .cse3)) (.cse6 (store .cse12 .cse17 0))) (or (and (= .cse5 .cse6) (or (= .cse5 .cse7) .cse8) (or .cse9 (= .cse5 .cse10)) (or .cse11 (= .cse5 .cse12)) (or (= .cse5 .cse4) .cse13)) (let ((.cse14 (@diff .cse6 .cse5))) (let ((.cse15 (store .cse6 .cse14 0))) (let ((.cse16 (@diff .cse15 .cse5))) (and (<= (+ .cse14 28) .cse3) .cse9 .cse11 (= .cse5 (store .cse15 .cse16 0)) (or (= .cse5 .cse15) (<= (+ .cse16 28) .cse3)) .cse13 .cse8))))))))))))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| 4) (or (and .cse2 (= .cse5 .cse1)) (let ((.cse23 (@diff .cse1 .cse5))) (let ((.cse24 (store .cse1 .cse23 0))) (let ((.cse25 (@diff .cse24 .cse5))) (let ((.cse27 (store .cse24 .cse25 0))) (let ((.cse26 (@diff .cse27 .cse5))) (let ((.cse21 (store .cse27 .cse26 0))) (let ((.cse22 (@diff .cse21 .cse5))) (and .cse2 (= .cse5 (store .cse21 .cse22 0)) (<= (+ .cse23 24) .cse0) (or (= .cse5 .cse24) (<= (+ .cse25 24) .cse0)) (or (<= (+ .cse22 24) .cse0) (= .cse5 .cse21)) (or (<= (+ .cse26 24) .cse0) (= .cse5 .cse27)))))))))))))) is different from false [2022-11-04 12:15:00,948 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse0 |c_~#cache~0.offset|)) (.cse2 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 ((as const (Array Int Int)) 0))) (and (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) .cse2 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse3) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| 4) (or (and .cse2 (= .cse4 .cse1)) (let ((.cse7 (@diff .cse1 .cse4))) (let ((.cse8 (store .cse1 .cse7 0))) (let ((.cse9 (@diff .cse8 .cse4))) (let ((.cse11 (store .cse8 .cse9 0))) (let ((.cse10 (@diff .cse11 .cse4))) (let ((.cse5 (store .cse11 .cse10 0))) (let ((.cse6 (@diff .cse5 .cse4))) (and .cse2 (= .cse4 (store .cse5 .cse6 0)) (<= (+ .cse7 24) .cse0) (or (= .cse4 .cse8) (<= (+ .cse9 24) .cse0)) (or (<= (+ .cse6 24) .cse0) (= .cse4 .cse5)) (or (<= (+ .cse10 24) .cse0) (= .cse4 .cse11)))))))))))))) is different from false [2022-11-04 12:15:19,082 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (let ((.cse10 (store .cse1 .cse2 0))) (let ((.cse11 (@diff .cse10 .cse0))) (let ((.cse6 (store .cse10 .cse11 0))) (let ((.cse7 (@diff .cse6 .cse0))) (let ((.cse8 (store .cse6 .cse7 0)) (.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse5 (+ .cse3 |c_~#cache~0.offset|)) (.cse9 (@diff .cse8 .cse0))) (and (or (= .cse0 .cse1) (<= (+ .cse2 24) .cse3)) (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 .cse3 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_838 Int) (v_ArrVal_836 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| 28) .cse5) (= (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| v_ArrVal_836) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_838) (select |c_#memory_int| |c_~#cache~0.base|)))) (or (= .cse0 .cse6) (<= (+ .cse7 24) .cse3)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse5) (= |c_~#cache~0.offset| 0) (or (= .cse0 .cse8) (<= (+ .cse9 24) .cse3)) (= .cse0 (store .cse8 .cse9 0)) (or (= .cse0 .cse10) (<= (+ .cse11 24) .cse3)) (= |c_~#cache~0.base| 4))))))))))) is different from false [2022-11-04 12:16:50,576 WARN L234 SmtUtils]: Spent 19.07s on a formula simplification. DAG size of input: 67 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:18:02,308 WARN L234 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 111 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:19:22,603 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse8 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse16 (@diff .cse8 .cse0))) (let ((.cse2 (store .cse8 .cse16 0))) (let ((.cse15 (@diff .cse2 .cse0))) (let ((.cse5 (store .cse2 .cse15 0))) (let ((.cse17 (@diff .cse5 .cse0))) (let ((.cse7 (store .cse5 .cse17 0))) (let ((.cse14 (@diff .cse7 .cse0)) (.cse11 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse4 (<= (+ .cse17 28) .cse11)) (.cse6 (<= (+ .cse14 28) .cse11)) (.cse9 (<= (+ 28 .cse16) .cse11)) (.cse3 (<= (+ .cse15 28) .cse11)) (.cse1 (store .cse7 .cse14 0))) (or (and (= .cse0 .cse1) (or (= .cse0 .cse2) .cse3) (or .cse4 (= .cse0 .cse5)) (or .cse6 (= .cse0 .cse7)) (or (= .cse0 .cse8) .cse9)) (let ((.cse10 (@diff .cse1 .cse0))) (let ((.cse12 (store .cse1 .cse10 0))) (let ((.cse13 (@diff .cse12 .cse0))) (and (<= (+ .cse10 28) .cse11) .cse4 .cse6 (= .cse0 (store .cse12 .cse13 0)) (or (= .cse0 .cse12) (<= (+ .cse13 28) .cse11)) .cse9 .cse3)))))))))))))) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) is different from false [2022-11-04 12:19:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:19:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:19:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-04 12:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-04 12:19:23,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-04 12:19:23,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82356ca5-13df-4226-a02d-e5499eb6f2e1/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-04 12:19:23,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:19:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:19:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 585768309, now seen corresponding path program 2 times [2022-11-04 12:19:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:19:23,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456698476] [2022-11-04 12:19:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:19:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:19:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat