./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-6b4ec56 [2022-11-20 16:26:57,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 16:26:57,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 16:26:57,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 16:26:57,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 16:26:57,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 16:26:57,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 16:26:57,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 16:26:57,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 16:26:57,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 16:26:57,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 16:26:57,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 16:26:57,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 16:26:57,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 16:26:57,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 16:26:57,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 16:26:57,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 16:26:57,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 16:26:57,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 16:26:57,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 16:26:57,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 16:26:57,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 16:26:57,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 16:26:57,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 16:26:57,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 16:26:57,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 16:26:57,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 16:26:57,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 16:26:57,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 16:26:57,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 16:26:57,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 16:26:57,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 16:26:57,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 16:26:57,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 16:26:57,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 16:26:57,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 16:26:57,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 16:26:57,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 16:26:57,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 16:26:57,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 16:26:57,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 16:26:57,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-20 16:26:57,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 16:26:57,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 16:26:57,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 16:26:57,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 16:26:57,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 16:26:57,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 16:26:57,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 16:26:57,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 16:26:57,711 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 16:26:57,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 16:26:57,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 16:26:57,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 16:26:57,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 16:26:57,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 16:26:57,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 16:26:57,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 16:26:57,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 16:26:57,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 16:26:57,716 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 16:26:57,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 16:26:57,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 16:26:57,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 16:26:57,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 16:26:57,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 16:26:57,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 16:26:57,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 16:26:57,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:26:57,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 16:26:57,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 16:26:57,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 16:26:57,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 16:26:57,722 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-20 16:26:57,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 16:26:57,722 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 16:26:57,723 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-20 16:26:57,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-20 16:26:57,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 16:26:57,724 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-20 16:26:57,724 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-20 16:26:57,724 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_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/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_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-20 16:26:58,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 16:26:58,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 16:26:58,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 16:26:58,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 16:26:58,166 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 16:26:58,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 16:27:01,171 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 16:27:01,435 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 16:27:01,437 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 16:27:01,458 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/data/9d4867aed/5b58607eb71f447da320f89a9fec6b9b/FLAGe044ba7df [2022-11-20 16:27:01,473 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/data/9d4867aed/5b58607eb71f447da320f89a9fec6b9b [2022-11-20 16:27:01,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 16:27:01,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 16:27:01,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 16:27:01,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 16:27:01,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 16:27:01,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:27:01" (1/1) ... [2022-11-20 16:27:01,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692d6588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:01, skipping insertion in model container [2022-11-20 16:27:01,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:27:01" (1/1) ... [2022-11-20 16:27:01,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 16:27:01,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 16:27:02,107 WARN L237 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_2495cb6f-c623-413e-9496-d3eba59f554a/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 16:27:02,113 WARN L237 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_2495cb6f-c623-413e-9496-d3eba59f554a/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 16:27:02,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:27:02,137 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 16:27:02,215 WARN L237 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_2495cb6f-c623-413e-9496-d3eba59f554a/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 16:27:02,219 WARN L237 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_2495cb6f-c623-413e-9496-d3eba59f554a/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 16:27:02,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:27:02,308 INFO L208 MainTranslator]: Completed translation [2022-11-20 16:27:02,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02 WrapperNode [2022-11-20 16:27:02,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 16:27:02,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 16:27:02,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 16:27:02,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 16:27:02,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,417 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-20 16:27:02,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 16:27:02,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 16:27:02,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 16:27:02,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 16:27:02,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,459 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 16:27:02,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 16:27:02,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 16:27:02,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 16:27:02,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (1/1) ... [2022-11-20 16:27:02,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:27:02,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:27:02,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 16:27:02,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 16:27:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 16:27:02,562 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 16:27:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 16:27:02,562 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 16:27:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 16:27:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 16:27:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 16:27:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 16:27:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 16:27:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 16:27:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 16:27:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 16:27:02,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 16:27:02,565 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 16:27:02,785 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 16:27:02,815 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 16:27:03,276 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 16:27:03,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 16:27:03,290 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 16:27:03,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:27:03 BoogieIcfgContainer [2022-11-20 16:27:03,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 16:27:03,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 16:27:03,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 16:27:03,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 16:27:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:27:01" (1/3) ... [2022-11-20 16:27:03,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28045260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:27:03, skipping insertion in model container [2022-11-20 16:27:03,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:02" (2/3) ... [2022-11-20 16:27:03,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28045260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:27:03, skipping insertion in model container [2022-11-20 16:27:03,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:27:03" (3/3) ... [2022-11-20 16:27:03,305 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-20 16:27:03,316 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 16:27:03,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 16:27:03,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-20 16:27:03,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 16:27:03,551 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 16:27:03,633 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:27:03,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:27:03,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:27:03,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:27:03,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-20 16:27:03,725 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:27:03,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-20 16:27:03,759 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;@4f6df958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:27:03,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 16:27:04,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1319727467, now seen corresponding path program 1 times [2022-11-20 16:27:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:04,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045182957] [2022-11-20 16:27:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:04,815 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-20 16:27:04,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:04,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045182957] [2022-11-20 16:27:04,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045182957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:27:04,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:27:04,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 16:27:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351810556] [2022-11-20 16:27:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:27:04,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 16:27:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 16:27:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 16:27:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:04,875 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:04,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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-20 16:27:04,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:04,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 16:27:04,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1423842390, now seen corresponding path program 1 times [2022-11-20 16:27:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:04,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919558387] [2022-11-20 16:27:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:05,499 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-20 16:27:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:05,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919558387] [2022-11-20 16:27:05,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919558387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:27:05,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:27:05,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:27:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646235687] [2022-11-20 16:27:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:27:05,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:27:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:27:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:27:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:05,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:05,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-20 16:27:05,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:05,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:05,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 16:27:05,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1119853959, now seen corresponding path program 1 times [2022-11-20 16:27:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:05,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183184629] [2022-11-20 16:27:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:09,210 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-20 16:27:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:09,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183184629] [2022-11-20 16:27:09,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183184629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:27:09,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:27:09,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:27:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293541383] [2022-11-20 16:27:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:27:09,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 16:27:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 16:27:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-20 16:27:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:09,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:09,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.0) internal successors, (95), 20 states have internal predecessors, (95), 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-20 16:27:09,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:09,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:09,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 16:27:10,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -828858809, now seen corresponding path program 1 times [2022-11-20 16:27:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:10,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836136098] [2022-11-20 16:27:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:11,014 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-20 16:27:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:11,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836136098] [2022-11-20 16:27:11,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836136098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:27:11,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:27:11,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:27:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763358356] [2022-11-20 16:27:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:27:11,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:27:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:27:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:27:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:11,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:11,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:27:11,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:11,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:11,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:11,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:11,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 16:27:11,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1017669425, now seen corresponding path program 1 times [2022-11-20 16:27:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:11,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397225212] [2022-11-20 16:27:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:13,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397225212] [2022-11-20 16:27:13,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397225212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:27:13,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:27:13,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:27:13,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971659372] [2022-11-20 16:27:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:27:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 16:27:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:13,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 16:27:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 16:27:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:13,545 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 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-20 16:27:13,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:13,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:13,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:13,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:13,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:27:14,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 16:27:14,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash -91224222, now seen corresponding path program 1 times [2022-11-20 16:27:14,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:14,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137358266] [2022-11-20 16:27:14,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:14,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:20,509 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-20 16:27:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137358266] [2022-11-20 16:27:20,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137358266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:27:20,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:27:20,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 16:27:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452503237] [2022-11-20 16:27:20,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:27:20,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 16:27:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 16:27:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-20 16:27:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:20,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:20,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.526315789473684) internal successors, (105), 20 states have internal predecessors, (105), 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-20 16:27:20,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:20,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:20,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:20,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:20,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:27:20,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:27:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:27:22,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 16:27:22,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:27:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:27:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 217716167, now seen corresponding path program 1 times [2022-11-20 16:27:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:27:22,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785250615] [2022-11-20 16:27:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:27:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:27:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785250615] [2022-11-20 16:27:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785250615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:27:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644884487] [2022-11-20 16:27:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:27:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:27:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:27:28,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:27:28,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 16:27:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:27:28,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 16:27:28,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:27:29,151 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:27:29,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:27:29,233 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:27:29,234 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-20 16:27:29,536 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-20 16:27:29,636 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-20 16:27:30,283 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-20 16:27:30,607 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-20 16:27:31,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:27:31,330 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 16:27:31,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:27:31,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:27:31,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:27:31,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:27:32,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:27:32,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:27:32,448 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-20 16:27:32,848 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:27:32,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:27:32,927 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:27:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:27:32,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:27:33,643 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:27:34,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_223 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225))))) is different from false [2022-11-20 16:27:34,474 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_223) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225))))) is different from false [2022-11-20 16:27:34,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_225) (< (+ (select .cse1 .cse3) 1) v_ArrVal_223))))) is different from false [2022-11-20 16:27:36,876 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_220)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse3 v_ArrVal_223) .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_223) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 16:27:42,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_223) .cse2 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_223) (< (+ (select .cse0 .cse2) 1) v_ArrVal_225) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse2))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse1) 2147483647))))))) is different from false [2022-11-20 16:27:42,725 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_223 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_220 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_227 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_219))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_220)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_223) .cse1 v_ArrVal_225)) |c_~#stored_elements~0.base| v_ArrVal_226) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_225) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_227) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_223))))))) is different from false [2022-11-20 16:27:44,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:44,293 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 2 case distinctions, treesize of input 270 treesize of output 185 [2022-11-20 16:27:44,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:44,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 644 treesize of output 640 [2022-11-20 16:27:44,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 292 treesize of output 280 [2022-11-20 16:27:44,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 525 treesize of output 501 [2022-11-20 16:27:44,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 375 treesize of output 343 [2022-11-20 16:27:44,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 16:27:45,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:45,358 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 251 treesize of output 267 [2022-11-20 16:27:47,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:27:47,194 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 45 treesize of output 85 [2022-11-20 16:27:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 16:27:47,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644884487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:27:47,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:27:47,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-11-20 16:27:47,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867966178] [2022-11-20 16:27:47,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:27:47,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-20 16:27:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:27:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-20 16:27:47,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=5188, Unknown=60, NotChecked=1092, Total=6972 [2022-11-20 16:27:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:47,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:27:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 4.469879518072289) internal successors, (371), 84 states have internal predecessors, (371), 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-20 16:27:47,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:27:47,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:27:47,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:27:47,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:27:47,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:27:47,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:27:47,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 16:28:00,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 16:28:00,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:00,527 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:28:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1840732794, now seen corresponding path program 1 times [2022-11-20 16:28:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:00,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841458582] [2022-11-20 16:28:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:02,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841458582] [2022-11-20 16:28:02,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841458582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470941510] [2022-11-20 16:28:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:02,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:02,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 16:28:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:02,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 16:28:02,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:03,454 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-20 16:28:03,730 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 24 [2022-11-20 16:28:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:03,890 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 18 treesize of output 20 [2022-11-20 16:28:04,418 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 16:28:04,418 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 27 treesize of output 32 [2022-11-20 16:28:04,549 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 17 treesize of output 9 [2022-11-20 16:28:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:04,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:28:05,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:05,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-20 16:28:05,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:05,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 60 [2022-11-20 16:28:05,704 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 32 treesize of output 28 [2022-11-20 16:28:05,726 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 10 treesize of output 6 [2022-11-20 16:28:05,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:05,738 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 48 treesize of output 48 [2022-11-20 16:28:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:06,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470941510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:28:06,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:28:06,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-11-20 16:28:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14563173] [2022-11-20 16:28:06,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:28:06,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 16:28:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:28:06,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 16:28:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2380, Unknown=13, NotChecked=0, Total=2652 [2022-11-20 16:28:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:06,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:28:06,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 7.313725490196078) internal successors, (373), 52 states have internal predecessors, (373), 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-20 16:28:06,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:06,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:06,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-20 16:28:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:28:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:28:35,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 16:28:35,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:35,483 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:28:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash -431098475, now seen corresponding path program 1 times [2022-11-20 16:28:35,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:35,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329346950] [2022-11-20 16:28:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:35,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 16:28:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:35,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329346950] [2022-11-20 16:28:35,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329346950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:28:35,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:28:35,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:28:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557996760] [2022-11-20 16:28:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:28:35,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:28:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:28:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:28:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 16:28:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:35,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:28:35,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 4 states have internal predecessors, (152), 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-20 16:28:35,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:35,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:28:35,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:28:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:28:35,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:35,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 16:28:35,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:28:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash -479150187, now seen corresponding path program 1 times [2022-11-20 16:28:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:35,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562362126] [2022-11-20 16:28:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:35,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:35,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:35,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562362126] [2022-11-20 16:28:35,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562362126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:35,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670132998] [2022-11-20 16:28:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:35,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:35,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:35,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 16:28:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:36,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 16:28:36,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:36,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 16:28:36,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670132998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:28:36,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 16:28:36,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 16:28:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530769755] [2022-11-20 16:28:36,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:28:36,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 16:28:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:28:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 16:28:36,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 16:28:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:36,146 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:28:36,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 38.25) internal successors, (153), 5 states have internal predecessors, (153), 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-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:36,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:28:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:28:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:28:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:28:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:28:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:28:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:28:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:28:36,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 16:28:36,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 16:28:36,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:28:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1890333377, now seen corresponding path program 1 times [2022-11-20 16:28:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:36,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71420731] [2022-11-20 16:28:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:39,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71420731] [2022-11-20 16:28:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71420731] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:39,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187712318] [2022-11-20 16:28:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:39,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:39,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:39,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:39,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 16:28:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 16:28:40,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:40,383 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:28:40,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:28:40,467 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:28:40,467 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-20 16:28:40,799 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-20 16:28:41,274 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-20 16:28:41,538 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-20 16:28:42,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:42,135 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-20 16:28:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 34 treesize of output 52 [2022-11-20 16:28:42,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:42,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:28:42,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 38 [2022-11-20 16:28:43,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 32 [2022-11-20 16:28:43,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:43,964 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 36 treesize of output 34 [2022-11-20 16:28:44,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:28:44,713 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-11-20 16:28:44,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2022-11-20 16:28:45,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:45,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:28:45,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 69 treesize of output 44 [2022-11-20 16:28:45,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 25 [2022-11-20 16:28:46,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:46,165 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-20 16:28:46,683 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:28:46,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:28:46,763 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:28:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:46,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:28:49,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_492))) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_496 1)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_494) (< 400 (select .cse1 .cse3))))))) is different from false [2022-11-20 16:28:50,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse3))) v_ArrVal_492))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< 400 (select .cse2 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse3)))))))) is different from false [2022-11-20 16:28:50,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_496 1)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_494) (< 400 (select .cse0 .cse2)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 .cse2))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647)))))) is different from false [2022-11-20 16:28:50,865 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_496 1)) (< 400 (select .cse0 .cse1)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_494) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1)))))))) is different from false [2022-11-20 16:28:50,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) v_ArrVal_492))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse3))) (< 400 (select .cse2 .cse3))))))) is different from false [2022-11-20 16:28:51,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) v_ArrVal_492))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse3))) (< 400 (select .cse2 .cse3))))))) (= 400 .cse8)))) is different from false [2022-11-20 16:28:51,555 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_487) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse4 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_494) .cse2 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< 400 (select .cse4 .cse2)) (not (<= v_ArrVal_487 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))))))) is different from false [2022-11-20 16:28:51,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_487) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< 400 (select .cse3 .cse1)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_487)))))) (= 400 .cse8)))) is different from false [2022-11-20 16:28:52,371 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_485)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select .cse3 .cse9))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_487) .cse9 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 400 (select .cse0 .cse1)) (= 400 .cse2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_487) (not (<= v_ArrVal_496 1)) (< (+ (select .cse0 .cse5) 1) v_ArrVal_494) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse6 .cse1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse5) 2147483647)))))))) is different from false [2022-11-20 16:28:52,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse2 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_485))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (select .cse2 .cse9))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_487) .cse9 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_492))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< 400 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_487) (not (<= v_ArrVal_496 1)) (< (+ (select .cse0 .cse4) 1) v_ArrVal_494) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse4) 2147483647) (= 400 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse5 .cse1)))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse10 .cse9)))))) is different from false [2022-11-20 16:28:52,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_485)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse6 (select .cse7 .cse1))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_487) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse2 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse3)) |c_~#queue~0.offset|) v_ArrVal_492))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_494) .cse3 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (< 400 (select .cse2 .cse3)) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse5) 2147483647) (= .cse6 400) (< (+ (select .cse2 .cse5) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< (+ (select .cse7 .cse8) 1) v_ArrVal_487) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse3))))))))))) is different from false [2022-11-20 16:28:58,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_494 Int) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_~#queue~0.offset|) v_ArrVal_485)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select .cse6 .cse1))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_487) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_492)))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (= 400 .cse2) (< 400 (select .cse3 .cse1)) (not (<= v_ArrVal_496 1)) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse1))) (< (+ (select .cse3 .cse5) 1) v_ArrVal_494) (< (+ (select .cse6 .cse5) 1) v_ArrVal_487)))))))))) is different from false [2022-11-20 16:28:59,217 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_499 Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (v_ArrVal_494 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| Int) (v_ArrVal_492 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| 4) |c_~#queue~0.offset|) v_ArrVal_485)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse5 .cse1))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_487) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_491))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_492)))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_494) .cse1 v_ArrVal_496)) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_32| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_494) (not (<= v_ArrVal_496 1)) (< (+ (select .cse5 .cse4) 1) v_ArrVal_487) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_499) .cse4) 2147483647) (< 400 (select .cse3 .cse1)) (= 400 .cse6)))))))))) is different from false [2022-11-20 16:29:00,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:00,807 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 1 case distinctions, treesize of input 1107 treesize of output 787 [2022-11-20 16:29:00,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:00,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3984 treesize of output 3942 [2022-11-20 16:29:00,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 3608 treesize of output 3480 [2022-11-20 16:29:01,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1984 treesize of output 1856 [2022-11-20 16:29:01,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 3144 treesize of output 2952 [2022-11-20 16:29:01,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1820 treesize of output 1756 [2022-11-20 16:29:01,293 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 8 treesize of output 4 [2022-11-20 16:29:18,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:18,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2746 treesize of output 2640 [2022-11-20 16:29:26,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:29:26,058 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 45 treesize of output 85 [2022-11-20 16:29:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-11-20 16:29:26,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187712318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:29:26,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:29:26,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39, 41] total 105 [2022-11-20 16:29:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126237836] [2022-11-20 16:29:26,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:29:26,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-11-20 16:29:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:29:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-11-20 16:29:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=7664, Unknown=89, NotChecked=2496, Total=10920 [2022-11-20 16:29:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:26,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:29:26,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 4.552380952380952) internal successors, (478), 105 states have internal predecessors, (478), 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-20 16:29:26,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:29:26,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:29:26,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:29:26,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:29:26,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:01,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:01,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:30:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:30:01,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 16:30:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 16:30:01,786 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:30:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:30:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -38506192, now seen corresponding path program 1 times [2022-11-20 16:30:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:30:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942215132] [2022-11-20 16:30:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:30:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:30:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:30:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:30:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:30:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942215132] [2022-11-20 16:30:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942215132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:30:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820489823] [2022-11-20 16:30:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:30:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:30:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:30:04,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:30:04,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 16:30:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:30:04,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 16:30:04,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:30:05,167 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:30:05,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:30:05,236 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:30:05,237 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-20 16:30:05,492 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-20 16:30:05,567 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-20 16:30:06,110 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-20 16:30:06,378 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-20 16:30:06,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:30:06,869 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:30:06,869 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:30:07,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:30:07,024 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-20 16:30:07,423 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 16:30:07,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:30:07,541 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-20 16:30:07,846 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:30:07,846 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:30:07,916 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-20 16:30:07,952 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-20 16:30:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:30:07,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:30:08,353 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:30:08,389 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:30:08,409 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:30:08,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) is different from false [2022-11-20 16:30:08,443 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647))) is different from false [2022-11-20 16:30:08,458 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-20 16:30:08,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_579 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2)) 2147483647))))) is different from false [2022-11-20 16:30:08,563 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_572)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1)) 2147483647) (= 400 .cse4))))) is different from false [2022-11-20 16:30:08,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_572))) (let ((.cse5 (select .cse4 .cse1))) (or (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_574) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse3)) 2147483647) (= 400 .cse5)))))))) is different from false [2022-11-20 16:30:08,649 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_579 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_572)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_574) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse4)))))))) is different from false [2022-11-20 16:30:09,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_571))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_572)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_574) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse2))))))))) is different from false [2022-11-20 16:30:09,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_574 Int) (v_ArrVal_572 Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_570) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_571))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_572)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_574) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse2))))))))) is different from false [2022-11-20 16:30:09,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:09,950 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 2 case distinctions, treesize of input 297 treesize of output 197 [2022-11-20 16:30:09,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:09,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 533 treesize of output 529 [2022-11-20 16:30:09,985 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 422 treesize of output 374 [2022-11-20 16:30:09,998 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 561 treesize of output 521 [2022-11-20 16:30:10,021 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 307 treesize of output 287 [2022-11-20 16:30:10,049 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 8 treesize of output 4 [2022-11-20 16:30:11,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:11,546 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 496 treesize of output 416 [2022-11-20 16:30:12,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:30:12,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-20 16:30:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-11-20 16:30:12,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820489823] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:30:12,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:30:12,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 29] total 76 [2022-11-20 16:30:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96960087] [2022-11-20 16:30:12,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:30:12,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 16:30:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:30:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 16:30:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3680, Unknown=17, NotChecked=1644, Total=5852 [2022-11-20 16:30:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:12,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:30:12,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 5.276315789473684) internal successors, (401), 77 states have internal predecessors, (401), 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-20 16:30:12,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:12,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:30:12,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:30:12,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:30:12,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:30:12,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:30:12,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-20 16:30:12,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:30:12,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:30:12,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:30:12,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:30:12,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:30:46,693 WARN L233 SmtUtils]: Spent 32.35s on a formula simplification. DAG size of input: 72 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:31:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:31:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:31:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:31:02,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 16:31:03,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 16:31:03,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:31:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:31:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1193691313, now seen corresponding path program 1 times [2022-11-20 16:31:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:31:03,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845558286] [2022-11-20 16:31:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:31:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:31:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:31:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:31:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:31:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845558286] [2022-11-20 16:31:04,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845558286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:31:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823273026] [2022-11-20 16:31:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:31:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:31:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:31:04,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:31:04,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 16:31:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:31:04,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 16:31:04,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:31:05,607 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-20 16:31:05,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:31:05,695 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 18 treesize of output 20 [2022-11-20 16:31:06,074 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 16:31:06,075 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 27 treesize of output 32 [2022-11-20 16:31:06,205 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 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 16:31:06,235 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 21 treesize of output 9 [2022-11-20 16:31:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:31:06,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:31:06,998 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 Int)) (or (< (+ v_ArrVal_650 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_649) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_650) (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-11-20 16:31:07,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:31:07,074 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 1 case distinctions, treesize of input 31 treesize of output 32 [2022-11-20 16:31:07,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:31:07,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 60 [2022-11-20 16:31:07,099 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 32 treesize of output 28 [2022-11-20 16:31:07,116 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 10 treesize of output 6 [2022-11-20 16:31:07,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:31:07,134 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 48 treesize of output 48 [2022-11-20 16:31:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:31:07,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823273026] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:31:07,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:31:07,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-11-20 16:31:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576984354] [2022-11-20 16:31:07,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:31:07,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 16:31:07,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:31:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 16:31:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1892, Unknown=1, NotChecked=88, Total=2162 [2022-11-20 16:31:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:31:07,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:31:07,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 8.782608695652174) internal successors, (404), 47 states have internal predecessors, (404), 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-20 16:31:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:31:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:31:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:31:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:31:07,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-20 16:31:07,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:31:07,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:32:38,779 WARN L233 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 86 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:33:00,687 WARN L233 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 87 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:33:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:33:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:33:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:33:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:33:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:33:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:33:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 16:33:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:33:38,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 16:33:38,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:33:38,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:33:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:33:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1413197191, now seen corresponding path program 2 times [2022-11-20 16:33:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:33:38,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982991743] [2022-11-20 16:33:38,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:33:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:33:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:33:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 143 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:33:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:33:40,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982991743] [2022-11-20 16:33:40,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982991743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:33:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291541885] [2022-11-20 16:33:40,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:33:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:33:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:33:40,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:33:40,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 16:33:40,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:33:40,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:33:40,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 16:33:40,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:33:41,717 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-20 16:33:41,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:41,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 16 treesize of output 18 [2022-11-20 16:33:42,038 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:33:42,038 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:33:42,099 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-20 16:33:42,116 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-20 16:33:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 146 proven. 76 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 16:33:42,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:33:42,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_765 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_764) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_~#queue~0.offset|) v_ArrVal_765) .cse1)))))) is different from false [2022-11-20 16:33:42,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:42,566 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 1 case distinctions, treesize of input 54 treesize of output 44 [2022-11-20 16:33:42,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:42,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 81 treesize of output 83 [2022-11-20 16:33:42,581 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 78 treesize of output 70 [2022-11-20 16:33:42,589 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 8 treesize of output 4 [2022-11-20 16:33:42,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:42,635 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 52 treesize of output 48 [2022-11-20 16:33:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 131 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 12 not checked. [2022-11-20 16:33:43,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291541885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:33:43,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:33:43,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2022-11-20 16:33:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053345029] [2022-11-20 16:33:43,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:33:43,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 16:33:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:33:43,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 16:33:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1105, Unknown=1, NotChecked=68, Total=1332 [2022-11-20 16:33:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:43,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:33:43,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 13.891891891891891) internal successors, (514), 37 states have internal predecessors, (514), 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-20 16:33:43,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:43,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:33:43,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:33:43,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:43,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:33:43,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:33:43,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:33:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:33:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:33:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:33:44,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 16:33:44,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 16:33:44,353 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:33:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:33:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -84225416, now seen corresponding path program 1 times [2022-11-20 16:33:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:33:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650134746] [2022-11-20 16:33:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:33:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:33:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:33:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:33:45,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:33:45,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650134746] [2022-11-20 16:33:45,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650134746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:33:45,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333025650] [2022-11-20 16:33:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:33:45,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:33:45,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:33:45,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:33:45,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 16:33:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:33:45,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 16:33:45,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:33:46,825 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-20 16:33:46,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:46,918 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-20 16:33:47,153 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:33:47,154 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:33:47,216 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-20 16:33:47,251 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-20 16:33:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 16:33:47,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:33:47,739 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| Int) (v_ArrVal_868 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_867) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| 4) |c_~#queue~0.offset|) v_ArrVal_868) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))) is different from false [2022-11-20 16:33:47,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:47,786 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 1 case distinctions, treesize of input 53 treesize of output 43 [2022-11-20 16:33:47,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:47,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 80 [2022-11-20 16:33:47,803 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 55 treesize of output 47 [2022-11-20 16:33:47,814 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 8 treesize of output 4 [2022-11-20 16:33:47,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:33:47,849 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 54 treesize of output 50 [2022-11-20 16:33:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 32 proven. 84 refuted. 0 times theorem prover too weak. 53 trivial. 12 not checked. [2022-11-20 16:33:48,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333025650] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:33:48,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:33:48,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 37 [2022-11-20 16:33:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278986898] [2022-11-20 16:33:48,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:33:48,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 16:33:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:33:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 16:33:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1183, Unknown=1, NotChecked=70, Total=1406 [2022-11-20 16:33:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:48,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:33:48,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 13.324324324324325) internal successors, (493), 38 states have internal predecessors, (493), 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-20 16:33:48,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:48,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:33:48,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:33:48,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:33:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:33:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:33:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:33:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:33:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:33:49,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 16:33:49,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:33:49,757 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:33:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:33:49,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1981507569, now seen corresponding path program 3 times [2022-11-20 16:33:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:33:49,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113527535] [2022-11-20 16:33:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:33:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:33:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:33:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 174 proven. 85 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 16:33:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:33:54,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113527535] [2022-11-20 16:33:54,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113527535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:33:54,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062005128] [2022-11-20 16:33:54,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:33:54,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:33:54,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:33:54,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:33:54,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 16:33:55,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 16:33:55,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:33:55,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-20 16:33:55,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:33:55,203 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:33:55,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:33:55,270 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:33:55,270 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-20 16:33:55,534 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-20 16:33:55,610 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-20 16:33:56,079 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-20 16:33:56,358 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-20 16:33:56,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:33:56,875 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:33:56,875 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:33:57,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:57,057 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-20 16:33:57,437 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 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-20 16:33:57,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:57,578 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-20 16:33:58,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:33:58,149 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:33:58,150 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:33:58,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:58,316 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-20 16:33:58,696 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 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-20 16:33:58,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:58,859 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-20 16:33:59,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:33:59,392 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:33:59,393 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:33:59,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:33:59,542 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-20 16:33:59,582 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 19 treesize of output 7 [2022-11-20 16:33:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 174 proven. 85 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 16:33:59,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:34:24,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_991 Int) (v_ArrVal_1001 Int) (v_ArrVal_1000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_999 Int) (v_ArrVal_997 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_986))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_988))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_989) .cse1 v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_995)))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_997) .cse1 v_ArrVal_999)) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_999) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_991) (not (= 400 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1)))))))))) is different from false [2022-11-20 16:34:24,649 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_999 Int) (v_ArrVal_997 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_991 Int) (v_ArrVal_1001 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_986))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_988))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_989) .cse1 v_ArrVal_991)) |c_~#stored_elements~0.base| v_ArrVal_993))) (let ((.cse3 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_995)))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_997) .cse1 v_ArrVal_999)) |c_~#stored_elements~0.base| v_ArrVal_1000) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_991) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| (select .cse2 .cse1))) (not (= 400 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_1001) .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_999)))))))) is different from false [2022-11-20 16:34:26,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:34:26,577 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 2 case distinctions, treesize of input 932 treesize of output 562 [2022-11-20 16:34:26,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:34:26,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1301 treesize of output 1295 [2022-11-20 16:34:26,620 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 977 treesize of output 953 [2022-11-20 16:34:26,641 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 730 treesize of output 718 [2022-11-20 16:34:26,661 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 868 treesize of output 804 [2022-11-20 16:34:26,710 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 856 treesize of output 808 [2022-11-20 16:34:26,734 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 8 treesize of output 4 [2022-11-20 16:34:27,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:34:27,204 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 276 treesize of output 268 [2022-11-20 16:34:28,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:34:28,323 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 45 treesize of output 85 [2022-11-20 16:34:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 201 proven. 57 refuted. 28 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:34:28,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062005128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:34:28,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:34:28,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 46] total 110 [2022-11-20 16:34:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649703148] [2022-11-20 16:34:28,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:34:28,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-11-20 16:34:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:34:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-11-20 16:34:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=10112, Unknown=166, NotChecked=426, Total=11990 [2022-11-20 16:34:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:34:28,567 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:34:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 5.572727272727272) internal successors, (613), 110 states have internal predecessors, (613), 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-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:34:28,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:34:28,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:34:28,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-20 16:34:28,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:34:28,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:34:28,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:34:28,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-20 16:35:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:35:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:35:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:35:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:35:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:35:21,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 16:35:21,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:35:21,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-20 16:35:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:35:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1831649785, now seen corresponding path program 2 times [2022-11-20 16:35:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:35:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037738588] [2022-11-20 16:35:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:35:21,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:35:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:35:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:35:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:35:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037738588] [2022-11-20 16:35:29,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037738588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:35:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895771211] [2022-11-20 16:35:29,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:35:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:35:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:35:29,411 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:35:29,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2495cb6f-c623-413e-9496-d3eba59f554a/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 16:35:29,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:35:29,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:35:29,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-20 16:35:29,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:35:29,870 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 16:35:29,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 16:35:29,970 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 16:35:29,971 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-20 16:35:30,277 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-20 16:35:30,375 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-20 16:35:30,975 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-20 16:35:31,264 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-20 16:35:31,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:35:31,909 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 16:35:31,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:35:32,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:35:32,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:35:32,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:35:32,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:35:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:35:33,119 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-20 16:35:33,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:35:33,731 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 16:35:33,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:35:34,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:35:34,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:35:34,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:35:34,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:35:34,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:35:34,978 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-20 16:35:35,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:35:35,520 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 16:35:35,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:35:35,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:35:35,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:35:35,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:35:36,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 30 [2022-11-20 16:35:36,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:35:36,674 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-20 16:35:37,073 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 16:35:37,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 16:35:37,131 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 16:35:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:35:37,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:35:37,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 16:35:37,748 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1123 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 16:35:37,797 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1123) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 16:35:37,817 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 16:35:38,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1121) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 16:35:38,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1118)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 16:35:38,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1125 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1118)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1121) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse1)))))) is different from false [2022-11-20 16:35:38,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse1 .cse4 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1123) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse3 .cse2))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1121)))))) is different from false [2022-11-20 16:35:44,548 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse2))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1121) (not (<= v_ArrVal_1115 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1123))))))) is different from false [2022-11-20 16:35:44,883 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse2))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1121) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse6 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1123)))))))) is different from false [2022-11-20 16:35:44,969 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse2))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1121) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse6 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1123))))))))) is different from false [2022-11-20 16:35:45,020 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse7 .cse8))) (or (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse2))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1121) (< (+ .cse4 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse5 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1123))))))) (= 400 .cse4)))) is different from false [2022-11-20 16:35:45,201 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1114) .cse8 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1121) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1123) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse4 .cse3))) (not (<= v_ArrVal_1114 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))))) is different from false [2022-11-20 16:35:45,697 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse3 .cse9))) (or (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1114) .cse9 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1121) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1123) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1114) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (< (+ .cse6 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse5 .cse2)))))))))) (= 400 .cse6)))) is different from false [2022-11-20 16:35:45,839 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1112)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1114) .cse9 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse9)) (.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (= .cse0 400) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1114) (< (+ .cse0 1) v_ArrVal_1115) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1123) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse4))) (< (+ (select .cse3 .cse6) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse5 .cse4)))))))))) is different from false [2022-11-20 16:35:45,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1112)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1114) .cse9 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse9)) (.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse2))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1114) (= 400 .cse0) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse7) 2147483647) (< (+ (select .cse3 .cse7) 1) v_ArrVal_1121)))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse10 .cse9)))))) is different from false [2022-11-20 16:35:46,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1114) .cse9 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse6 (select .cse4 .cse9))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1123) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1114) (= .cse6 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse7 .cse3))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse8 .cse9))) (< (+ .cse6 1) v_ArrVal_1115))))))))) is different from false [2022-11-20 16:35:54,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse7 (select .cse5 .cse1)) (.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1121) (not (<= v_ArrVal_1108 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse6 .cse1))) (< (+ .cse7 1) v_ArrVal_1115) (= 400 .cse7) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse1)))))))))))) is different from false [2022-11-20 16:35:55,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse9 (select .cse5 .cse1)) (.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1121) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse6 .cse1))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1108) (< (+ .cse9 1) v_ArrVal_1115) (= 400 .cse9) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse1))))))))))))) is different from false [2022-11-20 16:35:55,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1106) .cse9 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1114) .cse2 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse0 (select .cse7 .cse2))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse2))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse5) 2147483647) (< (+ .cse0 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse6 .cse2))) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1114) (< (+ (select .cse8 .cse9) 1) v_ArrVal_1108) (not (<= v_ArrVal_1106 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse5) 1) v_ArrVal_1121))))))))))) is different from false [2022-11-20 16:35:56,139 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1106) .cse9 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1114) .cse2 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse0 (select .cse7 .cse2))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse2))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_1106) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse2))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse5) 2147483647) (< (+ .cse0 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse6 .cse2))) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1114) (< (+ (select .cse8 .cse9) 1) v_ArrVal_1108) (< (+ (select .cse1 .cse5) 1) v_ArrVal_1121))))))))))) is different from false [2022-11-20 16:35:56,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1106) .cse10 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1114) .cse2 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse3 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse1 .cse7 v_ArrVal_1121) .cse2 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse0 (select .cse9 .cse2))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse4 .cse2))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1106) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse7) 2147483647) (< (+ .cse0 1) v_ArrVal_1115) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse8 .cse2))) (< (+ (select .cse9 .cse7) 1) v_ArrVal_1114) (< (+ (select .cse5 .cse10) 1) v_ArrVal_1108) (< (+ (select .cse1 .cse7) 1) v_ArrVal_1121))))))))))) is different from false [2022-11-20 16:35:56,500 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1104)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse5 v_ArrVal_1106) .cse1 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1114) .cse3 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse9 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse4 (select .cse7 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1108) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse2 .cse3))) (< (+ .cse4 1) v_ArrVal_1115) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1106) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse6 .cse3))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1114) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse8) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse9 .cse3))) (< (+ (select .cse10 .cse3) 1) v_ArrVal_1123) (< (+ (select .cse10 .cse8) 1) v_ArrVal_1121) (= .cse4 400))))))))))) is different from false [2022-11-20 16:35:56,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int)) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse5 (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1104)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse8 v_ArrVal_1106) .cse6 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1114) .cse4 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse3 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1121) .cse4 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse7 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1114) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1121) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1108) (< (+ .cse7 1) v_ArrVal_1115) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1123) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1106) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse9 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse10 .cse4))) (= 400 .cse7))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse13 .cse6)))))) is different from false [2022-11-20 16:35:56,960 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse11 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4)) v_ArrVal_1104)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1106) .cse10 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1114) .cse7 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse0 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1121) .cse7 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse7))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1106) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1121) (< (+ .cse5 1) v_ArrVal_1115) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse8 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse9 .cse7))) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1123) (= 400 .cse5) (< (+ (select .cse2 .cse10) 1) v_ArrVal_1108) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse11 .cse10)))))))))))))) is different from false [2022-11-20 16:36:15,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1103))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1104)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1106) .cse1 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse8 (select .cse9 .cse1)) (.cse7 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1108) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1121) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse6) 2147483647) (= 400 .cse8) (< (+ .cse8 1) v_ArrVal_1115) (< (+ (select .cse9 .cse6) 1) v_ArrVal_1114) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1123) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1106) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse7 .cse1))))))))))))))) is different from false [2022-11-20 16:36:16,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1103))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1104)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1106) .cse3 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1114) .cse3 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1121) .cse3 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse7 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1106) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse5 .cse3))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1121) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1108) (< (+ .cse7 1) v_ArrVal_1115) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse9 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse8 .cse3))) (= 400 .cse7) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1123))))))))))))) is different from false [2022-11-20 16:36:19,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1121 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1112 Int) (v_ArrVal_1123 Int) (v_ArrVal_1100 Int) (v_ArrVal_1114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1125 Int) (v_ArrVal_1104 Int) (v_ArrVal_1115 Int) (v_ArrVal_1118 Int) (v_ArrVal_1106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1108 Int)) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1100)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1103))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1104)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_1106) .cse1 v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_1112))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1114) .cse1 v_ArrVal_1115)) |c_~#stored_elements~0.base| v_ArrVal_1117))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_1118))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1121) .cse1 v_ArrVal_1123)) |c_~#stored_elements~0.base| v_ArrVal_1124) |c_~#queue~0.base|)) (.cse6 (select .cse9 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_1125) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| (select .cse5 .cse1))) (= .cse6 400) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1121) (not (<= v_ArrVal_1100 0)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1123) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1108) (< (+ .cse6 1) v_ArrVal_1115) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1106) (< (+ (select .cse9 .cse3) 1) v_ArrVal_1114))))))))))))) is different from false [2022-11-20 16:36:19,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:36:19,478 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 2 case distinctions, treesize of input 1675 treesize of output 1110 [2022-11-20 16:36:19,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:36:19,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4383 treesize of output 4369 [2022-11-20 16:36:19,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 3275 treesize of output 3251 [2022-11-20 16:36:19,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1547 treesize of output 1535 [2022-11-20 16:36:19,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1761 treesize of output 1633 [2022-11-20 16:36:19,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 2607 treesize of output 2511 [2022-11-20 16:36:19,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 3059 treesize of output 2995 [2022-11-20 16:36:20,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 16:36:22,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:36:22,391 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 1262 treesize of output 1278 [2022-11-20 16:36:38,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:36:38,607 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 45 treesize of output 85 [2022-11-20 16:36:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 48 refuted. 16 times theorem prover too weak. 0 trivial. 107 not checked. [2022-11-20 16:36:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895771211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:36:38,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:36:38,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 53] total 143 [2022-11-20 16:36:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618128471] [2022-11-20 16:36:38,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:36:38,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2022-11-20 16:36:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:36:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2022-11-20 16:36:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1674, Invalid=11683, Unknown=95, NotChecked=7140, Total=20592 [2022-11-20 16:36:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:36:38,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:36:38,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 143 states have (on average 4.314685314685315) internal successors, (617), 144 states have internal predecessors, (617), 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-20 16:36:38,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:36:38,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:36:38,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:36:38,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:37:29,111 WARN L233 SmtUtils]: Spent 12.51s on a formula simplification. DAG size of input: 167 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:37:58,568 WARN L233 SmtUtils]: Spent 12.56s on a formula simplification. DAG size of input: 165 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:38:27,980 WARN L233 SmtUtils]: Spent 12.86s on a formula simplification. DAG size of input: 166 DAG size of output: 159 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:39:12,054 WARN L233 SmtUtils]: Spent 27.73s on a formula simplification. DAG size of input: 179 DAG size of output: 171 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:39:39,578 WARN L233 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 120 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:40:12,103 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:40:51,199 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)