./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- 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-8393723 [2022-11-18 01:40:22,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 01:40:22,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 01:40:22,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 01:40:22,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 01:40:22,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 01:40:22,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 01:40:22,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 01:40:22,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 01:40:22,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 01:40:22,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 01:40:22,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 01:40:22,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 01:40:22,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 01:40:22,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 01:40:22,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 01:40:22,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 01:40:22,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 01:40:22,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 01:40:22,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 01:40:22,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 01:40:22,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 01:40:22,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 01:40:22,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 01:40:22,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 01:40:22,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 01:40:22,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 01:40:22,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 01:40:22,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 01:40:22,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 01:40:22,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 01:40:22,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 01:40:22,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 01:40:22,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 01:40:22,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 01:40:22,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 01:40:22,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 01:40:22,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 01:40:22,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 01:40:22,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 01:40:22,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 01:40:22,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-18 01:40:22,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 01:40:22,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 01:40:22,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 01:40:22,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 01:40:22,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 01:40:22,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 01:40:22,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 01:40:22,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 01:40:22,934 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 01:40:22,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 01:40:22,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 01:40:22,936 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 01:40:22,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 01:40:22,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 01:40:22,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 01:40:22,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 01:40:22,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 01:40:22,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 01:40:22,938 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 01:40:22,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 01:40:22,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 01:40:22,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 01:40:22,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 01:40:22,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 01:40:22,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 01:40:22,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-18 01:40:22,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 01:40:22,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 01:40:22,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 01:40:22,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 01:40:22,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 01:40:22,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 01:40:22,942 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-18 01:40:22,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 01:40:22,943 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 01:40:22,943 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-18 01:40:22,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-18 01:40:22,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 01:40:22,944 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-18 01:40:22,944 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-18 01:40:22,944 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_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/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_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k 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 ! overflow) ) 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 -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2022-11-18 01:40:23,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 01:40:23,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 01:40:23,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 01:40:23,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 01:40:23,321 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 01:40:23,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/../../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2022-11-18 01:40:23,405 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/data/d13ede7fa/2f4cd281dccd455c93f604206d595651/FLAG80c5fdaea [2022-11-18 01:40:24,149 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 01:40:24,149 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2022-11-18 01:40:24,184 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/data/d13ede7fa/2f4cd281dccd455c93f604206d595651/FLAG80c5fdaea [2022-11-18 01:40:24,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/data/d13ede7fa/2f4cd281dccd455c93f604206d595651 [2022-11-18 01:40:24,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 01:40:24,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 01:40:24,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 01:40:24,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 01:40:24,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 01:40:24,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:40:24" (1/1) ... [2022-11-18 01:40:24,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44165cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:24, skipping insertion in model container [2022-11-18 01:40:24,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:40:24" (1/1) ... [2022-11-18 01:40:24,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 01:40:24,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 01:40:25,246 WARN L234 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_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2022-11-18 01:40:25,306 WARN L234 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_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2022-11-18 01:40:25,317 WARN L234 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_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2022-11-18 01:40:25,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 01:40:25,351 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 01:40:25,394 WARN L234 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_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2022-11-18 01:40:25,412 WARN L234 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_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2022-11-18 01:40:25,415 WARN L234 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_f0e868bb-b83b-44b4-bc78-106e24506f93/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2022-11-18 01:40:25,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 01:40:25,527 INFO L208 MainTranslator]: Completed translation [2022-11-18 01:40:25,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25 WrapperNode [2022-11-18 01:40:25,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 01:40:25,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 01:40:25,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 01:40:25,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 01:40:25,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,730 INFO L138 Inliner]: procedures = 489, calls = 127, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1805 [2022-11-18 01:40:25,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 01:40:25,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 01:40:25,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 01:40:25,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 01:40:25,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 01:40:25,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 01:40:25,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 01:40:25,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 01:40:25,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (1/1) ... [2022-11-18 01:40:25,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 01:40:25,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:40:25,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 01:40:25,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 01:40:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2022-11-18 01:40:25,997 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2022-11-18 01:40:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 01:40:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 01:40:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 01:40:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 01:40:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 01:40:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 01:40:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 01:40:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 01:40:25,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 01:40:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 01:40:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 01:40:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 01:40:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 01:40:26,001 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 01:40:26,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 01:40:26,440 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 01:40:28,764 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 01:40:29,288 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 01:40:29,289 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-18 01:40:29,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:40:29 BoogieIcfgContainer [2022-11-18 01:40:29,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 01:40:29,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 01:40:29,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 01:40:29,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 01:40:29,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:40:24" (1/3) ... [2022-11-18 01:40:29,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7f4d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:40:29, skipping insertion in model container [2022-11-18 01:40:29,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:40:25" (2/3) ... [2022-11-18 01:40:29,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7f4d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:40:29, skipping insertion in model container [2022-11-18 01:40:29,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:40:29" (3/3) ... [2022-11-18 01:40:29,313 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2022-11-18 01:40:29,324 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 01:40:29,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 01:40:29,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 90 error locations. [2022-11-18 01:40:29,337 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 01:40:29,522 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-18 01:40:29,665 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 01:40:29,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-18 01:40:29,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:40:29,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-18 01:40:29,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-18 01:40:29,762 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-18 01:40:29,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-18 01:40:29,792 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;@3001b591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 01:40:29,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-18 01:40:29,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 217550942, now seen corresponding path program 1 times [2022-11-18 01:40:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:29,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293779577] [2022-11-18 01:40:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:30,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293779577] [2022-11-18 01:40:30,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293779577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:30,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:40:30,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 01:40:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559851904] [2022-11-18 01:40:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:30,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 01:40:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 01:40:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 01:40:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:30,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:30,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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-18 01:40:30,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:30,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 01:40:30,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash 458218433, now seen corresponding path program 1 times [2022-11-18 01:40:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:30,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734449820] [2022-11-18 01:40:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:31,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734449820] [2022-11-18 01:40:31,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734449820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:31,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:40:31,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 01:40:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816416404] [2022-11-18 01:40:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:31,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 01:40:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 01:40:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 01:40:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:31,095 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:31,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-18 01:40:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:31,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:31,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 01:40:31,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1057927376, now seen corresponding path program 1 times [2022-11-18 01:40:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633370729] [2022-11-18 01:40:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:31,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633370729] [2022-11-18 01:40:31,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633370729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:31,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:40:31,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 01:40:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748292471] [2022-11-18 01:40:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 01:40:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 01:40:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 01:40:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:31,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:31,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 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-18 01:40:31,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:31,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:31,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:32,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 01:40:32,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -908328453, now seen corresponding path program 1 times [2022-11-18 01:40:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:32,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089512207] [2022-11-18 01:40:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089512207] [2022-11-18 01:40:33,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089512207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 01:40:33,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465600657] [2022-11-18 01:40:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:40:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:40:33,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 01:40:33,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 01:40:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:33,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 01:40:33,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 01:40:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:33,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 01:40:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:33,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465600657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 01:40:33,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 01:40:33,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 01:40:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829939152] [2022-11-18 01:40:33,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 01:40:33,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 01:40:33,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 01:40:33,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 01:40:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:33,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:33,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-18 01:40:33,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:33,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:33,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:33,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:33,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 01:40:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:40:34,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1005314413, now seen corresponding path program 1 times [2022-11-18 01:40:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:34,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766076281] [2022-11-18 01:40:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766076281] [2022-11-18 01:40:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766076281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 01:40:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690776328] [2022-11-18 01:40:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:40:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:40:34,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 01:40:34,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 01:40:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:34,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 01:40:34,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 01:40:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 01:40:34,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 01:40:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690776328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 01:40:34,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-18 01:40:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033288286] [2022-11-18 01:40:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:34,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 01:40:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 01:40:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 01:40:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:34,678 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:34,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-18 01:40:34,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:34,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:34,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:34,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:34,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 01:40:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:34,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 01:40:35,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:40:35,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2012690726, now seen corresponding path program 1 times [2022-11-18 01:40:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334761498] [2022-11-18 01:40:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 01:40:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:35,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334761498] [2022-11-18 01:40:35,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334761498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:35,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:40:35,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 01:40:35,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826872496] [2022-11-18 01:40:35,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:35,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 01:40:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:35,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 01:40:35,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 01:40:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:35,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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-18 01:40:35,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:35,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:35,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-18 01:40:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:35,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 01:40:35,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 871325905, now seen corresponding path program 2 times [2022-11-18 01:40:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:35,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32357318] [2022-11-18 01:40:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-18 01:40:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32357318] [2022-11-18 01:40:35,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32357318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:35,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:40:35,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 01:40:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855257564] [2022-11-18 01:40:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:35,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 01:40:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:35,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 01:40:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 01:40:35,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:35,640 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:35,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 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-18 01:40:35,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:35,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:35,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:35,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:35,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:35,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:35,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:36,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 01:40:36,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1009330952, now seen corresponding path program 1 times [2022-11-18 01:40:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:36,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315731864] [2022-11-18 01:40:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-18 01:40:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:36,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315731864] [2022-11-18 01:40:36,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315731864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:40:36,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:40:36,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 01:40:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525811009] [2022-11-18 01:40:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:40:36,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 01:40:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:36,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 01:40:36,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 01:40:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:36,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:36,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-18 01:40:36,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:36,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:36,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:36,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:36,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:36,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:36,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:36,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:37,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 01:40:37,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash 170449571, now seen corresponding path program 1 times [2022-11-18 01:40:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:37,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664614181] [2022-11-18 01:40:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-18 01:40:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:40:37,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664614181] [2022-11-18 01:40:37,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664614181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 01:40:37,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323573852] [2022-11-18 01:40:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:40:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:40:37,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 01:40:37,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 01:40:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:40:38,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 01:40:38,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 01:40:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 01:40:38,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 01:40:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 01:40:38,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323573852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 01:40:38,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 01:40:38,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 11 [2022-11-18 01:40:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440016811] [2022-11-18 01:40:38,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 01:40:38,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 01:40:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:40:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 01:40:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 01:40:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:38,358 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:40:38,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 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-18 01:40:38,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:38,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:38,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:38,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:38,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:38,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:38,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:38,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:38,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:40:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:40:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:40:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:40:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:40:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:40:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 01:40:38,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 01:40:39,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:40:39,118 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:40:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:40:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2079009758, now seen corresponding path program 1 times [2022-11-18 01:40:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:40:39,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966650517] [2022-11-18 01:40:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:40:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:40:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:42:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 01:42:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:42:10,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966650517] [2022-11-18 01:42:10,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966650517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 01:42:10,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552848733] [2022-11-18 01:42:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:42:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:42:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:42:10,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 01:42:10,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 01:42:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:42:11,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-18 01:42:11,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 01:42:12,223 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 01:42:12,224 INFO L350 Elim1Store]: Elim1 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-18 01:42:14,490 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-18 01:42:14,863 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-18 01:42:16,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:42:16,454 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-18 01:42:17,327 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-18 01:42:17,512 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-18 01:42:17,699 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-18 01:42:18,467 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-18 01:42:18,877 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-18 01:42:21,774 INFO L321 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2022-11-18 01:42:21,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 120 [2022-11-18 01:42:21,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2022-11-18 01:42:21,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2022-11-18 01:42:21,876 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 01:42:21,876 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 1 [2022-11-18 01:42:21,891 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 01:42:21,892 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 23 treesize of output 7 [2022-11-18 01:42:21,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2022-11-18 01:42:21,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-18 01:42:22,446 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-18 01:42:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 01:42:23,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 01:42:25,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:42:25,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2022-11-18 01:42:25,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:42:25,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2022-11-18 01:42:26,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 01:42:30,594 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))))) is different from false [2022-11-18 01:42:30,838 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2022-11-18 01:42:30,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))))) is different from false [2022-11-18 01:42:30,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse2 0)) (= (select (select .cse3 |c_~#q~0.base|) .cse1) .cse2))))))) is different from false [2022-11-18 01:42:31,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2022-11-18 01:42:31,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_930) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2022-11-18 01:42:31,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2022-11-18 01:42:31,463 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= 0 .cse2)))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_929) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= 0 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)))))))) is different from false [2022-11-18 01:42:31,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_928) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_928) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse2 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse2 0)) (= (select (select .cse3 |c_~#q~0.base|) .cse1) .cse2))))))) is different from false [2022-11-18 01:42:33,541 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse3 (select (select .cse4 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse3 (select (select .cse4 |c_~#q~0.base|) .cse1)) (not (= .cse3 0)))))))) is different from false [2022-11-18 01:42:33,639 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|))) (and (forall ((|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int)) (or (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store .cse3 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)) (not (= .cse0 0)))))) (not (<= |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247|)))) (forall ((|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int)) (or (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store .cse3 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (forall ((v_ArrVal_934 Int)) (< (select (select (store .cse4 |c_~#q~0.base| (store (select .cse4 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)) (not (= (select (select .cse4 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (not (<= |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247|)))))) is different from false [2022-11-18 01:42:33,829 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store .cse3 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse0) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| |c_ULTIMATE.start_writeV_~v#1.offset|))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_934 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store .cse3 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse4 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| |c_ULTIMATE.start_writeV_~v#1.offset|) (< (select (select (store .cse4 |c_~#q~0.base| (store (select .cse4 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)))))) is different from false [2022-11-18 01:42:44,394 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#q~0.base|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#q~0.base| (store .cse4 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse0 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse3))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_934 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#q~0.base| (store .cse4 |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (not (= (select (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse3) (< (select (select (store .cse5 |c_~#q~0.base| (store (select .cse5 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647)))))) is different from false [2022-11-18 01:42:44,499 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|)) (.cse0 (+ |c_~#q~0.offset| 36)) (.cse4 (select |c_#memory_int| |c_~#q~0.base|)) (.cse5 (+ 104 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_924 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse4 .cse5 v_ArrVal_924) |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (let ((.cse3 (select (select .cse1 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse0) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse3) (not (= .cse3 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (|v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| Int) (v_ArrVal_924 Int) (v_ArrVal_934 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse4 .cse5 v_ArrVal_924) |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| v_ArrVal_927)) |c_~#items~0.base| v_ArrVal_931) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_932))) (or (< (select (select (store .cse6 |c_~#q~0.base| (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_934)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 2147483647) (< |v_ULTIMATE.start_atomic_exchange_~obj#1.offset_247| .cse0) (not (= (select (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2022-11-18 01:42:44,977 INFO L321 Elim1Store]: treesize reduction 57, result has 49.1 percent of original size [2022-11-18 01:42:44,978 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 94 [2022-11-18 01:42:45,085 INFO L321 Elim1Store]: treesize reduction 4, result has 93.8 percent of original size [2022-11-18 01:42:45,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1438 treesize of output 1319 [2022-11-18 01:42:45,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:42:45,137 INFO L350 Elim1Store]: Elim1 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 1224 treesize of output 1034 [2022-11-18 01:42:45,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:42:45,186 INFO L350 Elim1Store]: Elim1 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 1024 treesize of output 934 [2022-11-18 01:42:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:42:51,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 01:42:51,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 01:42:51,454 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-18 01:42:51,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 69 [2022-11-18 01:42:51,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 01:42:51,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 01:42:51,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 01:42:51,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 663 treesize of output 623 [2022-11-18 01:42:51,528 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 01:42:51,529 INFO L350 Elim1Store]: Elim1 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 811 treesize of output 765 [2022-11-18 01:42:51,555 INFO L350 Elim1Store]: Elim1 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 374 treesize of output 364 [2022-11-18 01:42:51,569 INFO L350 Elim1Store]: Elim1 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 744 treesize of output 724 [2022-11-18 01:42:56,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:42:56,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 78 [2022-11-18 01:42:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 40 not checked. [2022-11-18 01:42:56,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552848733] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 01:42:56,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 01:42:56,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35, 41] total 111 [2022-11-18 01:42:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624480323] [2022-11-18 01:42:56,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 01:42:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-18 01:42:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:42:56,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-18 01:42:57,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=8716, Unknown=91, NotChecked=2842, Total=12210 [2022-11-18 01:42:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:42:57,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:42:57,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 4.063063063063063) internal successors, (451), 111 states have internal predecessors, (451), 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-18 01:42:57,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:42:57,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:42:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:42:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:42:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:42:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:42:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:42:57,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:42:57,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-18 01:42:57,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:44:35,347 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 241 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 01:44:37,513 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse62 (select |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base|)) (.cse31 ((as const (Array Int Int)) 0))) (let ((.cse18 (@diff .cse62 .cse31))) (let ((.cse67 (store .cse62 .cse18 0))) (let ((.cse26 (@diff .cse67 .cse31))) (let ((.cse66 (store .cse67 .cse26 0))) (let ((.cse22 (@diff .cse66 .cse31))) (let ((.cse61 (store .cse66 .cse22 0))) (let ((.cse19 (@diff .cse61 .cse31)) (.cse15 (select |c_#memory_int| |c_~#q~0.base|)) (.cse63 (+ |c_~#q~0.offset| 28)) (.cse64 (+ 104 |c_~#q~0.offset|)) (.cse65 (+ |c_~#q~0.offset| 24))) (let ((.cse59 (store (store (store .cse15 .cse63 0) .cse64 0) .cse65 0)) (.cse55 (store (store (store .cse62 .cse63 0) .cse64 0) .cse65 0)) (.cse60 (store .cse61 .cse19 0))) (let ((.cse24 (@diff .cse60 .cse31)) (.cse12 (@diff .cse55 .cse31)) (.cse58 (@diff .cse59 .cse31))) (let ((.cse56 (store .cse59 .cse58 0)) (.cse53 (store .cse55 .cse12 0)) (.cse52 (store .cse60 .cse24 0))) (let ((.cse28 (@diff .cse52 .cse31)) (.cse14 (@diff .cse53 .cse31)) (.cse6 (= |c_ULTIMATE.start_main_~#handles~0#1.base| |c_~#q~0.base|)) (.cse57 (@diff .cse56 .cse31)) (.cse54 (+ |c_~#q~0.offset| 36))) (let ((.cse1 (or (<= .cse54 .cse58) (= .cse31 .cse59))) (.cse2 (or (= .cse31 .cse56) (<= .cse54 .cse57))) (.cse3 (= .cse31 (store .cse56 .cse57 0))) (.cse4 (not .cse6)) (.cse5 (= |c_ULTIMATE.start_main_~#handles~0#1.offset| 0)) (.cse8 (<= .cse54 .cse12)) (.cse9 (= .cse31 .cse55)) (.cse7 (= .cse31 (store .cse53 .cse14 0))) (.cse10 (<= .cse54 .cse14)) (.cse11 (= .cse31 .cse53)) (.cse20 (+ .cse19 4)) (.cse21 (+ .cse22 4)) (.cse23 (+ .cse24 4)) (.cse25 (+ .cse26 4)) (.cse16 (+ 4 .cse18)) (.cse27 (= .cse31 (store .cse52 .cse28 0))) (.cse29 (+ 4 .cse28)) (.cse0 (select |c_#memory_int| 3))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (= (select .cse0 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) 0) (or (and .cse1 (not (= |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| |c_~#q~0.base|)) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 (or .cse8 .cse9) (not (= |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| |c_ULTIMATE.start_main_~#handles~0#1.base|)) (or .cse10 .cse11))) (or (and .cse1 .cse2 .cse3 .cse4) (let ((.cse13 (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) |c_ULTIMATE.start_main_~#handles~0#1.offset|))) (and .cse5 .cse6 (= |c_ULTIMATE.start_main_~i~2#1| 0) (or .cse8 .cse9 (= .cse12 .cse13)) .cse7 (or .cse10 .cse11 (= .cse14 .cse13))))) (= (select .cse15 (+ 32 |c_~#q~0.offset|)) 0) (= |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset| 0) (= 32 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (= 3 |c_StealerThread1of1ForFork0_readV_~v#1.base|) (let ((.cse17 (+ |c_StealerThread1of1ForFork0_readV_#in~v#1.offset| 4))) (or (and (or (<= .cse16 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (<= .cse17 .cse18)) (or (<= .cse17 .cse19) (<= .cse20 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|)) (or (<= .cse21 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (<= .cse17 .cse22)) (= |c_ULTIMATE.start_main_~#handles~0#1.base| |c_StealerThread1of1ForFork0_readV_#in~v#1.base|) (or (<= .cse23 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (<= .cse17 .cse24)) (or (<= .cse25 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (<= .cse17 .cse26)) .cse27 (or (<= .cse17 .cse28) (<= .cse29 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|))) (let ((.cse36 (select |c_#memory_int| |c_StealerThread1of1ForFork0_readV_#in~v#1.base|))) (let ((.cse35 (@diff .cse36 .cse31))) (let ((.cse40 (store .cse36 .cse35 0))) (let ((.cse39 (@diff .cse40 .cse31))) (let ((.cse37 (store .cse40 .cse39 0))) (let ((.cse38 (@diff .cse37 .cse31))) (let ((.cse32 (store .cse37 .cse38 0))) (let ((.cse30 (@diff .cse32 .cse31))) (let ((.cse34 (store .cse32 .cse30 0))) (let ((.cse33 (@diff .cse34 .cse31))) (and (or (<= .cse17 .cse30) (= .cse31 .cse32) (<= (+ .cse30 4) |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|)) (or (<= .cse17 .cse33) (= .cse31 .cse34) (<= (+ .cse33 4) |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|)) (or (<= (+ .cse35 4) |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (= .cse31 .cse36) (<= .cse17 .cse35)) (= .cse31 (store .cse34 .cse33 0)) (or (= .cse31 .cse37) (<= (+ .cse38 4) |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (<= .cse17 .cse38)) (or (= (select .cse36 .cse39) 0) (<= (+ .cse39 4) |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (<= .cse17 .cse39))))))))))))))) (<= 32 |c_StealerThread1of1ForFork0_readV_#in~v#1.offset|) (let ((.cse41 (+ |c_StealerThread1of1ForFork0_readV_~v#1.offset| 4))) (or (and (or (<= .cse20 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (<= .cse41 .cse19)) (or (<= .cse41 .cse22) (<= .cse21 |c_StealerThread1of1ForFork0_readV_~v#1.offset|)) (or (<= .cse41 .cse24) (<= .cse23 |c_StealerThread1of1ForFork0_readV_~v#1.offset|)) (or (<= .cse25 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (<= .cse41 .cse26)) (or (<= .cse16 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (<= .cse41 .cse18)) .cse27 (or (<= .cse41 .cse28) (<= .cse29 |c_StealerThread1of1ForFork0_readV_~v#1.offset|)) (= |c_ULTIMATE.start_main_~#handles~0#1.base| |c_StealerThread1of1ForFork0_readV_~v#1.base|)) (let ((.cse43 (select |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base|))) (let ((.cse42 (@diff .cse43 .cse31))) (let ((.cse47 (store .cse43 .cse42 0))) (let ((.cse48 (@diff .cse47 .cse31))) (let ((.cse45 (store .cse47 .cse48 0))) (let ((.cse46 (@diff .cse45 .cse31))) (let ((.cse51 (store .cse45 .cse46 0))) (let ((.cse49 (@diff .cse51 .cse31))) (let ((.cse50 (store .cse51 .cse49 0))) (let ((.cse44 (@diff .cse50 .cse31))) (and (or (<= (+ .cse42 4) |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (= (select .cse43 .cse42) 0) (<= .cse41 .cse42)) (or (<= .cse41 .cse44) (= (select .cse43 .cse44) 0) (<= (+ .cse44 4) |c_StealerThread1of1ForFork0_readV_~v#1.offset|)) (or (= .cse31 .cse45) (<= .cse41 .cse46) (<= (+ .cse46 4) |c_StealerThread1of1ForFork0_readV_~v#1.offset|)) (or (= .cse31 .cse47) (<= .cse41 .cse48) (<= (+ .cse48 4) |c_StealerThread1of1ForFork0_readV_~v#1.offset|)) (or (<= (+ .cse49 4) |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (= (select .cse43 .cse49) 0) (<= .cse41 .cse49)) (= .cse31 (store .cse50 .cse44 0))))))))))))))) (= |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| |c_~#items~0.base|) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (= |c_~#items~0.base| 4) (= 3 |c_StealerThread1of1ForFork0_readV_#in~v#1.base|) (= 32 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (= (select .cse0 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) 0) (<= 32 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) (not (= |c_~#items~0.base| |c_~#q~0.base|)))))))))))))))) is different from true [2022-11-18 01:45:07,106 WARN L233 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 185 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 01:45:16,325 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 189 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 01:45:19,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 01:45:21,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 01:45:24,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 01:45:27,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 01:45:29,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 01:45:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:45:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:45:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:45:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:45:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:45:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 01:45:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 01:45:32,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 01:45:32,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 01:45:32,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:45:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:45:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1053339270, now seen corresponding path program 1 times [2022-11-18 01:45:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:45:32,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2488172] [2022-11-18 01:45:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:45:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:45:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:45:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 01:45:32,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:45:32,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2488172] [2022-11-18 01:45:32,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2488172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 01:45:32,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 01:45:32,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 01:45:32,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994923629] [2022-11-18 01:45:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 01:45:32,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 01:45:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 01:45:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 01:45:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 01:45:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:45:32,941 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-18 01:45:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-18 01:45:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:45:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:45:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:45:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:45:32,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:32,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:32,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:45:32,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-18 01:45:32,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-18 01:45:32,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-18 01:45:37,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 01:45:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 01:45:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:45:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 01:45:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 01:45:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 01:45:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 01:45:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-18 01:45:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 01:45:40,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 01:45:40,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2022-11-18 01:45:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 01:45:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -855635797, now seen corresponding path program 1 times [2022-11-18 01:45:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 01:45:40,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72766773] [2022-11-18 01:45:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:45:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 01:45:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:48:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 01:48:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 01:48:03,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72766773] [2022-11-18 01:48:03,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72766773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 01:48:03,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753400017] [2022-11-18 01:48:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 01:48:03,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 01:48:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 [2022-11-18 01:48:03,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 01:48:03,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0e868bb-b83b-44b4-bc78-106e24506f93/bin/ugemcutter-AnMVkTqH3k/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 01:48:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 01:48:03,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 182 conjunts are in the unsatisfiable core [2022-11-18 01:48:03,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 01:48:05,001 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 01:48:05,002 INFO L350 Elim1Store]: Elim1 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-18 01:48:08,106 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-18 01:48:08,677 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-18 01:48:11,810 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-18 01:48:13,641 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-18 01:48:13,925 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-18 01:48:14,209 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-18 01:48:15,492 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-18 01:48:16,086 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-18 01:48:20,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:48:20,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:48:20,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:20,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 122 [2022-11-18 01:48:20,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 87 [2022-11-18 01:48:20,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2022-11-18 01:48:20,321 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 01:48:20,321 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 45 [2022-11-18 01:48:20,338 INFO L350 Elim1Store]: Elim1 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-18 01:48:20,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:48:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:48:20,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-18 01:48:26,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:48:26,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 01:48:26,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:26,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-18 01:48:31,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 94 [2022-11-18 01:48:31,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 88 [2022-11-18 01:48:31,444 INFO L321 Elim1Store]: treesize reduction 63, result has 41.1 percent of original size [2022-11-18 01:48:31,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 135 [2022-11-18 01:48:31,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-18 01:48:31,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-18 01:48:31,684 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 01:48:31,684 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 1 [2022-11-18 01:48:33,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:33,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 189 treesize of output 193 [2022-11-18 01:48:33,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 164 [2022-11-18 01:48:33,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 161 [2022-11-18 01:48:33,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 155 [2022-11-18 01:48:33,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 152 [2022-11-18 01:48:33,388 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-18 01:48:33,436 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-18 01:48:33,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 01:48:33,555 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 10 [2022-11-18 01:48:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 01:48:35,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 01:48:37,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:37,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2022-11-18 01:48:37,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:37,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2022-11-18 01:48:40,423 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-18 01:48:58,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:58,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 115 [2022-11-18 01:48:58,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:48:58,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 109 [2022-11-18 01:49:50,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse3 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 (select (select .cse5 |c_~#q~0.base|) .cse4))))) (let ((.cse0 (select .cse3 |c_~#q~0.base|))) (let ((.cse2 (select (select (store .cse3 |c_~#q~0.base| (store .cse0 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse0 .cse1) .cse2) (not (= .cse2 0))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse9 (select (select .cse10 |c_~#q~0.base|) .cse4))) (let ((.cse7 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 .cse9)))) (let ((.cse8 (store (select .cse7 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse1 v_ArrVal_1300)) v_subst_2) 0) (+ .cse9 1)))))))) (not (= (select .cse11 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse4) .cse13)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse12 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse1 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0))))) (not (= .cse13 0)))))))) is different from false [2022-11-18 01:49:51,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1))) (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse7 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse7 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse10 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse7 0 (select (select .cse11 |c_~#q~0.base|) .cse5))))) (let ((.cse9 (select .cse10 |c_~#q~0.base|))) (let ((.cse8 (select (select (store .cse10 |c_~#q~0.base| (store .cse9 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse8 0)) (= .cse8 (select .cse9 .cse3))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse13 (select .cse14 |c_~#q~0.base|))) (or (not (= .cse12 0)) (not (= .cse12 (select .cse13 .cse5))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse13 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))))) is different from false [2022-11-18 01:49:51,484 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1)))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select .cse8 |c_~#q~0.base|)) (.cse7 (select (select .cse8 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse7 0)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse8 |c_~#q~0.base| (store .cse10 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select .cse10 .cse5) .cse7)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse5))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (= .cse12 (select .cse13 .cse3)) (not (= .cse12 0))))))))))))) is different from false [2022-11-18 01:49:51,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse9 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse10 |c_~#q~0.base|) .cse4))))) (let ((.cse8 (select .cse9 |c_~#q~0.base|))) (let ((.cse7 (select (select (store .cse9 |c_~#q~0.base| (store .cse8 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= 0 .cse7)) (= (select .cse8 .cse2) .cse7)))))) (not (= (select .cse11 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse13 (select .cse14 |c_~#q~0.base|))) (or (not (= .cse12 0)) (not (= (select .cse13 .cse4) .cse12)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse13 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))))) is different from false [2022-11-18 01:49:52,319 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse4 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 (select (select .cse6 |c_~#q~0.base|) .cse5))))) (let ((.cse1 (select .cse4 |c_~#q~0.base|))) (let ((.cse3 (select (select (store .cse4 |c_~#q~0.base| (store .cse1 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse1 .cse2) .cse3) (not (= .cse3 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse7 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse7 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse10 (select (select .cse11 |c_~#q~0.base|) .cse5))) (let ((.cse8 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse7 0 .cse10)))) (let ((.cse9 (store (select .cse8 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse10 1)))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse5) .cse13)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse12 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse13 0)))))))) is different from false [2022-11-18 01:49:52,441 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1))) (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select (select .cse7 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse9 (select .cse7 |c_~#q~0.base|))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse7 |c_~#q~0.base| (store .cse9 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0))))) (not (= .cse10 0)) (not (= .cse10 (select .cse9 .cse5))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1282) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse5))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (= .cse12 (select .cse13 .cse3)) (not (= .cse12 0))))))))))))) is different from false [2022-11-18 01:49:53,282 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1))) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse9 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse10 |c_~#q~0.base|) .cse4))))) (let ((.cse7 (select .cse9 |c_~#q~0.base|))) (let ((.cse8 (select (select (store .cse9 |c_~#q~0.base| (store .cse7 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse7 .cse2) .cse8) (not (= 0 .cse8))))))) (not (= (select .cse11 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= (select .cse12 .cse4) .cse13)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse12 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse13 0)))))))) is different from false [2022-11-18 01:49:53,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select (select .cse7 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse9 (select .cse7 |c_~#q~0.base|))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse7 |c_~#q~0.base| (store .cse9 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0))))) (not (= .cse10 0)) (not (= .cse10 (select .cse9 .cse4))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1281) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse4))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse12 0)) (= .cse12 (select .cse13 .cse2))))))))))))) is different from false [2022-11-18 01:49:54,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select (select .cse3 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse1 (select .cse3 |c_~#q~0.base|))) (or (not (= .cse0 0)) (not (= .cse0 (select .cse1 .cse2))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse4 (store .cse1 .cse2 v_ArrVal_1293))) (or (not (= (select (select (store .cse3 |c_~#q~0.base| .cse4) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse5 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse3 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse6 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse9 (select (select .cse10 |c_~#q~0.base|) .cse2))) (let ((.cse7 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse9)))) (let ((.cse8 (store (select .cse7 |c_~#q~0.base|) .cse2 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse5 v_ArrVal_1300)) v_subst_2) 0) (+ .cse9 1))) (not (= (select (select (store .cse7 |c_~#q~0.base| .cse8) v_subst_2) 0) 0))))))))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse11 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse15 |c_~#q~0.base|) .cse2))))) (let ((.cse12 (select .cse14 |c_~#q~0.base|))) (let ((.cse13 (select (select (store .cse14 |c_~#q~0.base| (store .cse12 .cse2 v_ArrVal_1293)) v_subst_1) 0))) (or (= (select .cse12 .cse5) .cse13) (not (= .cse13 0))))))))))))) is different from false [2022-11-18 01:49:54,393 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse4 (select (select .cse6 |c_~#q~0.base|) .cse5))) (let ((.cse1 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 .cse4)))) (let ((.cse2 (store (select .cse1 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse1 |c_~#q~0.base| (store .cse2 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse4 1))) (not (= (select (select (store .cse1 |c_~#q~0.base| .cse2) v_subst_2) 0) 0))))))))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse11 (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse9 (store .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse11 0 (select (select .cse10 |c_~#q~0.base|) .cse5))))) (let ((.cse8 (select .cse9 |c_~#q~0.base|))) (let ((.cse7 (select (select (store .cse9 |c_~#q~0.base| (store .cse8 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse7 0)) (= .cse7 (select .cse8 .cse3))))))) (not (= (select .cse11 0) 0)))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_1280) |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse14 (select .cse12 |c_~#q~0.base|)) (.cse15 (select (select .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse13 (store .cse14 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse12 |c_~#q~0.base| .cse13) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse12 |c_~#q~0.base| (store .cse13 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse12 |c_~#q~0.base| (store .cse14 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select .cse14 .cse5) .cse15)) (not (= .cse15 0)))))))) is different from false [2022-11-18 01:49:55,296 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_~v#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse4 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 (select (select .cse6 |c_~#q~0.base|) .cse5))))) (let ((.cse2 (select .cse4 |c_~#q~0.base|))) (let ((.cse1 (select (select (store .cse4 |c_~#q~0.base| (store .cse2 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse1 0)) (= (select .cse2 .cse3) .cse1)))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse8 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse10 (select .cse8 |c_~#q~0.base|)) (.cse11 (select (select .cse8 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse8 |c_~#q~0.base| (store .cse10 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse11 0)) (not (= (select .cse10 .cse5) .cse11)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse16 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse12 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse15 (select (select .cse16 |c_~#q~0.base|) .cse5))) (let ((.cse13 (store .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse12 0 .cse15)))) (let ((.cse14 (store (select .cse13 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse13 |c_~#q~0.base| .cse14) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse13 |c_~#q~0.base| (store .cse14 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse15 1)))))))))))))) is different from false [2022-11-18 01:49:55,383 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse6 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse0 (select .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse0 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse4 (store .cse6 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse0 0 (select (select .cse6 |c_~#q~0.base|) .cse5))))) (let ((.cse2 (select .cse4 |c_~#q~0.base|))) (let ((.cse1 (select (select (store .cse4 |c_~#q~0.base| (store .cse2 .cse5 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse1 0)) (= .cse1 (select .cse2 .cse3))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse10 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse8 (select (select .cse10 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse9 (select .cse10 |c_~#q~0.base|))) (or (not (= .cse8 0)) (not (= .cse8 (select .cse9 .cse5))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse11 (store .cse9 .cse5 v_ArrVal_1293))) (or (not (= (select (select (store .cse10 |c_~#q~0.base| .cse11) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse10 |c_~#q~0.base| (store .cse11 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse10 |c_~#q~0.base| (store .cse9 .cse5 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse16 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse12 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse15 (select (select .cse16 |c_~#q~0.base|) .cse5))) (let ((.cse13 (store .cse16 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse12 0 .cse15)))) (let ((.cse14 (store (select .cse13 |c_~#q~0.base|) .cse5 v_ArrVal_1293))) (or (not (= 0 (select (select (store .cse13 |c_~#q~0.base| .cse14) v_subst_2) 0))) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse13 |c_~#q~0.base| (store .cse14 .cse3 v_ArrVal_1300)) v_subst_2) 0) (+ .cse15 1)))))))))))))) is different from false [2022-11-18 01:49:55,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse3 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 (select (select .cse5 |c_~#q~0.base|) .cse4))))) (let ((.cse1 (select .cse3 |c_~#q~0.base|))) (let ((.cse0 (select (select (store .cse3 |c_~#q~0.base| (store .cse1 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse0 0)) (= (select .cse1 .cse2) .cse0)))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse12 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse10 (select (select .cse11 |c_~#q~0.base|) .cse4))) (let ((.cse8 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse12 0 .cse10)))) (let ((.cse9 (store (select .cse8 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse10 1))) (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0))))))) (not (= (select .cse12 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse14 (select .cse15 |c_~#q~0.base|)) (.cse13 (select (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse13 (select .cse14 .cse4))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse16 (store .cse14 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse15 |c_~#q~0.base| (store .cse16 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse15 |c_~#q~0.base| (store .cse14 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse15 |c_~#q~0.base| .cse16) v_subst_2) 0) 0))))) (not (= .cse13 0)))))))) is different from false [2022-11-18 01:49:55,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_~w#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse12 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse8 (select .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse8 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse11 (store .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse8 0 (select (select .cse12 |c_~#q~0.base|) .cse4))))) (let ((.cse10 (select .cse11 |c_~#q~0.base|))) (let ((.cse9 (select (select (store .cse11 |c_~#q~0.base| (store .cse10 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse9 0)) (= .cse9 (select .cse10 .cse2))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse16 (select .cse14 |c_~#q~0.base|)) (.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (not (= .cse13 0)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse16 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse16 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select .cse16 .cse4) .cse13)))))))) is different from false [2022-11-18 01:49:55,885 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse5 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse6 (select .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse3 (select (select .cse5 |c_~#q~0.base|) .cse4))) (let ((.cse0 (store .cse5 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse6 0 .cse3)))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse3 1)))))))) (not (= (select .cse6 0) 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse12 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse8 (select .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse8 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse11 (store .cse12 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse8 0 (select (select .cse12 |c_~#q~0.base|) .cse4))))) (let ((.cse10 (select .cse11 |c_~#q~0.base|))) (let ((.cse9 (select (select (store .cse11 |c_~#q~0.base| (store .cse10 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (= .cse9 (select .cse10 .cse2)) (not (= .cse9 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse14 (store (store .cse7 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse13 (select (select .cse14 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0)) (.cse16 (select .cse14 |c_~#q~0.base|))) (or (not (= .cse13 0)) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse15 (store .cse16 .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse14 |c_~#q~0.base| (store .cse15 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse14 |c_~#q~0.base| (store .cse16 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1))) (not (= (select (select (store .cse14 |c_~#q~0.base| .cse15) v_subst_2) 0) 0))))) (not (= .cse13 (select .cse16 .cse4))))))))) is different from false [2022-11-18 01:49:55,987 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base|) |c_ULTIMATE.start_writeV_#in~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse3 (select .cse0 |c_~#q~0.base|)) (.cse5 (select (select .cse0 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0))) (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1288 Int) (v_subst_2 Int)) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_1293))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) v_subst_2) 0) 0)) (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_1288)) |StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= .cse5 (select .cse3 .cse4))) (not (= .cse5 0)))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (store (store .cse6 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse7 (select .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (not (= (select .cse7 0) 0)) (forall ((v_ArrVal_1293 Int) (v_subst_2 Int)) (let ((.cse10 (select (select .cse11 |c_~#q~0.base|) .cse4))) (let ((.cse8 (store .cse11 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse7 0 .cse10)))) (let ((.cse9 (store (select .cse8 |c_~#q~0.base|) .cse4 v_ArrVal_1293))) (or (forall ((v_ArrVal_1300 Int)) (< (select (select (store .cse8 |c_~#q~0.base| (store .cse9 .cse2 v_ArrVal_1300)) v_subst_2) 0) (+ .cse10 1))) (not (= (select (select (store .cse8 |c_~#q~0.base| .cse9) v_subst_2) 0) 0))))))))))) (forall ((|StealerThread1of1ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse15 (store (store .cse6 |c_~#items~0.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_1284))) (let ((.cse16 (select .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base|))) (or (forall ((v_ArrVal_1293 Int) (v_subst_1 Int)) (let ((.cse14 (store .cse15 |StealerThread1of1ForFork0_readV_~#expected~0#1.base| (store .cse16 0 (select (select .cse15 |c_~#q~0.base|) .cse4))))) (let ((.cse13 (select .cse14 |c_~#q~0.base|))) (let ((.cse12 (select (select (store .cse14 |c_~#q~0.base| (store .cse13 .cse4 v_ArrVal_1293)) v_subst_1) 0))) (or (not (= .cse12 0)) (= .cse12 (select .cse13 .cse2))))))) (not (= (select .cse16 0) 0)))))))) is different from false [2022-11-18 01:50:35,828 INFO L321 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2022-11-18 01:50:35,829 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 412 treesize of output 184 [2022-11-18 01:50:36,012 INFO L321 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2022-11-18 01:50:36,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 348301 treesize of output 333597 [2022-11-18 01:50:50,325 WARN L233 SmtUtils]: Spent 14.31s on a formula simplification. DAG size of input: 988 DAG size of output: 988 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 01:50:50,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:50:50,441 INFO L350 Elim1Store]: Elim1 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 352164 treesize of output 344834 [2022-11-18 01:50:55,539 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 1038 DAG size of output: 1037 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 01:50:55,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 01:50:55,674 INFO L350 Elim1Store]: Elim1 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 698072 treesize of output 663050 [2022-11-18 01:51:41,824 WARN L233 SmtUtils]: Spent 46.15s on a formula simplification. DAG size of input: 1052 DAG size of output: 1052 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 01:51:43,545 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-18 01:51:58,110 WARN L233 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 793 DAG size of output: 793 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 01:52:08,710 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 791 DAG size of output: 791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 01:52:21,127 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 791 DAG size of output: 791 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 01:52:38,749 WARN L233 SmtUtils]: Spent 13.00s on a formula simplification. DAG size of input: 789 DAG size of output: 789 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)