./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-ext/02_inc_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:34:57,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:34:57,753 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-12-02 20:34:57,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:34:57,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:34:57,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:34:57,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:34:57,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:34:57,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:34:57,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:34:57,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:34:57,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:34:57,787 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:34:57,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:34:57,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:34:57,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:34:57,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:34:57,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:34:57,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:34:57,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:34:57,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:34:57,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:34:57,795 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:34:57,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:34:57,796 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:34:57,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:34:57,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:34:57,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:34:57,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:34:57,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:34:57,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:34:57,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:34:57,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:34:57,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:34:57,799 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:34:57,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:34:57,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:34:57,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:34:57,800 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:34:57,800 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:34:57,800 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:34:57,800 INFO L153 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_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/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_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2023-12-02 20:34:57,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:34:58,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:34:58,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:34:58,020 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:34:58,020 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:34:58,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2023-12-02 20:35:00,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:35:00,974 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:35:00,975 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2023-12-02 20:35:00,989 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/data/7df4dbdce/97f14db8bca249948a547fc3ff9b203a/FLAGcad555a1c [2023-12-02 20:35:01,003 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/data/7df4dbdce/97f14db8bca249948a547fc3ff9b203a [2023-12-02 20:35:01,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:35:01,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:35:01,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:35:01,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:35:01,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:35:01,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c644824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01, skipping insertion in model container [2023-12-02 20:35:01,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,053 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:35:01,310 WARN L240 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_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2023-12-02 20:35:01,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:35:01,327 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:35:01,364 WARN L240 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_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2023-12-02 20:35:01,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:35:01,397 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:35:01,397 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:35:01,405 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:35:01,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01 WrapperNode [2023-12-02 20:35:01,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:35:01,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:35:01,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:35:01,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:35:01,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,449 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-12-02 20:35:01,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:35:01,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:35:01,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:35:01,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:35:01,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:35:01,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:35:01,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:35:01,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:35:01,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (1/1) ... [2023-12-02 20:35:01,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:35:01,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:01,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:35:01,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:35:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:35:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-02 20:35:01,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-02 20:35:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:35:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 20:35:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:35:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:35:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:35:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:35:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 20:35:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:35:01,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:35:01,548 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:35:01,688 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:35:01,690 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:35:01,830 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:35:01,956 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:35:01,956 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:35:01,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:35:01 BoogieIcfgContainer [2023-12-02 20:35:01,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:35:01,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:35:01,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:35:01,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:35:01,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:35:01" (1/3) ... [2023-12-02 20:35:01,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd8e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:35:01, skipping insertion in model container [2023-12-02 20:35:01,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:35:01" (2/3) ... [2023-12-02 20:35:01,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd8e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:35:01, skipping insertion in model container [2023-12-02 20:35:01,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:35:01" (3/3) ... [2023-12-02 20:35:01,966 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-12-02 20:35:01,973 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:35:01,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:35:01,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:35:01,981 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:35:02,020 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:35:02,058 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:02,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:35:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:02,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:35:02,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:35:02,090 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:35:02,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-12-02 20:35:02,112 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=LoopHeads, 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;@382e7977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:02,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:35:02,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:02,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:02,223 INFO L85 PathProgramCache]: Analyzing trace with hash 19561318, now seen corresponding path program 1 times [2023-12-02 20:35:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724692881] [2023-12-02 20:35:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:02,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724692881] [2023-12-02 20:35:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724692881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:35:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413154347] [2023-12-02 20:35:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:35:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:35:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:35:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:02,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:02,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-12-02 20:35:02,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:02,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:35:02,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:02,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 691933217, now seen corresponding path program 1 times [2023-12-02 20:35:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204511282] [2023-12-02 20:35:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204511282] [2023-12-02 20:35:03,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204511282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:03,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:03,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 20:35:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884002600] [2023-12-02 20:35:03,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:03,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:35:03,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:35:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 20:35:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:03,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:03,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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) [2023-12-02 20:35:03,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:03,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:35:03,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:03,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -833348320, now seen corresponding path program 1 times [2023-12-02 20:35:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284563670] [2023-12-02 20:35:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284563670] [2023-12-02 20:35:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284563670] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788542010] [2023-12-02 20:35:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:04,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:04,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:04,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:35:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:05,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 20:35:05,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:35:05,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:35:05,107 INFO L378 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 [2023-12-02 20:35:05,197 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-12-02 20:35:05,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2023-12-02 20:35:05,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:35:05,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:05,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:35:05,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:05,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-12-02 20:35:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:05,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:35:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788542010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:05,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:35:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2023-12-02 20:35:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223365073] [2023-12-02 20:35:05,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:05,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:35:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:35:05,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-02 20:35:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:05,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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) [2023-12-02 20:35:05,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:05,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:35:05,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 20:35:05,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:35:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-02 20:35:05,761 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-02 20:35:05,763 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-12-02 20:35:05,766 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:05,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:35:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:05,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:35:05,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-12-02 20:35:05,772 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:35:05,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:35:05,773 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=LoopHeads, 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;@382e7977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:05,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:35:05,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:05,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1618562975, now seen corresponding path program 1 times [2023-12-02 20:35:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807909684] [2023-12-02 20:35:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:05,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:05,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807909684] [2023-12-02 20:35:05,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807909684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:05,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:05,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:35:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83500303] [2023-12-02 20:35:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:05,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:35:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:35:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:35:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:05,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-12-02 20:35:05,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:05,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:35:05,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:05,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -772103782, now seen corresponding path program 1 times [2023-12-02 20:35:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049247447] [2023-12-02 20:35:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:06,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049247447] [2023-12-02 20:35:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049247447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:06,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:06,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 20:35:06,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046212378] [2023-12-02 20:35:06,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:06,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:35:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:06,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:35:06,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:35:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:06,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:06,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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) [2023-12-02 20:35:06,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:06,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:06,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:35:06,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:06,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1039098973, now seen corresponding path program 1 times [2023-12-02 20:35:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797138104] [2023-12-02 20:35:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:35:06,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:35:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:35:06,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:35:06,736 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:35:06,737 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-12-02 20:35:06,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 20:35:06,739 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-02 20:35:06,739 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-12-02 20:35:06,740 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:35:06,740 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-02 20:35:06,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:35:06,763 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:06,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:35:06,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:06,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:35:06,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-12-02 20:35:06,774 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:35:06,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:35:06,775 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=LoopHeads, 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;@382e7977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:06,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:35:06,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:06,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1017308915, now seen corresponding path program 1 times [2023-12-02 20:35:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037224869] [2023-12-02 20:35:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:06,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:06,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037224869] [2023-12-02 20:35:06,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037224869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:06,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:35:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605734921] [2023-12-02 20:35:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:06,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:35:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:06,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:35:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:35:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:06,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:06,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2023-12-02 20:35:06,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:07,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 20:35:07,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:07,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 335739395, now seen corresponding path program 1 times [2023-12-02 20:35:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873733066] [2023-12-02 20:35:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:07,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873733066] [2023-12-02 20:35:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873733066] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969822936] [2023-12-02 20:35:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:07,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:07,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:07,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:35:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:07,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 20:35:07,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:07,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:35:07,882 INFO L378 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 [2023-12-02 20:35:07,930 INFO L378 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 11 [2023-12-02 20:35:08,109 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 20:35:08,110 INFO L378 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 20:35:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:08,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:35:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969822936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:35:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2023-12-02 20:35:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482076962] [2023-12-02 20:35:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:35:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:35:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-02 20:35:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:08,266 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:08,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-12-02 20:35:08,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:08,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:08,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 20:35:08,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:08,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:08,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -968851834, now seen corresponding path program 1 times [2023-12-02 20:35:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644127230] [2023-12-02 20:35:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644127230] [2023-12-02 20:35:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644127230] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006482350] [2023-12-02 20:35:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:09,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:09,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:35:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:09,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 20:35:09,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:09,573 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:35:09,573 INFO L378 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 [2023-12-02 20:35:09,615 INFO L378 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 11 [2023-12-02 20:35:09,662 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-12-02 20:35:09,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 20:35:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 20:35:10,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-02 20:35:10,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 20:35:10,227 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:35:10,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:35:10,421 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-02 20:35:10,437 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:35:10,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-12-02 20:35:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:10,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:35:11,115 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_226))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse3 4294967296))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_ArrVal_225) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) 0)) (= .cse0 4294967295) (< .cse0 (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse3))) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 20:35:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006482350] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:35:21,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:35:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2023-12-02 20:35:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400625823] [2023-12-02 20:35:21,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:35:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 20:35:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 20:35:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=985, Unknown=22, NotChecked=66, Total=1260 [2023-12-02 20:35:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:21,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:21,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 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) [2023-12-02 20:35:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:35:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:35:22,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 20:35:22,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:22,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:35:22,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 942770601, now seen corresponding path program 1 times [2023-12-02 20:35:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421454626] [2023-12-02 20:35:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:35:22,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:35:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:35:22,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:35:22,635 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:35:22,635 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-12-02 20:35:22,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:35:22,637 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-02 20:35:22,637 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-12-02 20:35:22,637 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:35:22,637 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-02 20:35:22,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:35:22,672 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:22,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:35:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:22,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:35:22,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-12-02 20:35:22,678 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:35:22,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-12-02 20:35:22,678 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=LoopHeads, 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;@382e7977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:35:22,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:35:22,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:22,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1398027588, now seen corresponding path program 1 times [2023-12-02 20:35:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191424867] [2023-12-02 20:35:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:35:22,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191424867] [2023-12-02 20:35:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191424867] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:35:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691807754] [2023-12-02 20:35:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:22,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:35:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:35:22,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:35:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:22,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:22,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) [2023-12-02 20:35:22,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:23,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 20:35:23,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:23,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1765456501, now seen corresponding path program 1 times [2023-12-02 20:35:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355098995] [2023-12-02 20:35:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:35:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355098995] [2023-12-02 20:35:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355098995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:35:23,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:35:23,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 20:35:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433322520] [2023-12-02 20:35:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:35:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:35:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:35:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:35:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:23,633 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:23,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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) [2023-12-02 20:35:23,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:23,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:35:24,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 20:35:24,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:24,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -923542824, now seen corresponding path program 1 times [2023-12-02 20:35:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801501406] [2023-12-02 20:35:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801501406] [2023-12-02 20:35:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801501406] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665353107] [2023-12-02 20:35:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:24,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:24,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:35:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:24,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 20:35:24,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:24,841 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-02 20:35:24,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 20:35:24,983 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2023-12-02 20:35:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2023-12-02 20:35:25,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2023-12-02 20:35:25,293 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:35:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 20:35:25,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2023-12-02 20:35:25,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2023-12-02 20:35:25,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2023-12-02 20:35:25,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-12-02 20:35:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:25,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:35:25,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:25,900 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2023-12-02 20:35:25,920 INFO L378 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 53 treesize of output 37 [2023-12-02 20:35:25,931 INFO L378 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 17 treesize of output 15 [2023-12-02 20:35:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665353107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:35:26,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:35:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2023-12-02 20:35:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111121439] [2023-12-02 20:35:26,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:35:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 20:35:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 20:35:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=311, Unknown=1, NotChecked=0, Total=380 [2023-12-02 20:35:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:26,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:26,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 19 states have internal predecessors, (75), 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) [2023-12-02 20:35:26,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:26,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:35:26,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:35:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:35:26,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:35:27,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 20:35:27,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:27,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1217756251, now seen corresponding path program 1 times [2023-12-02 20:35:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118458262] [2023-12-02 20:35:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 20:35:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118458262] [2023-12-02 20:35:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118458262] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760481041] [2023-12-02 20:35:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:27,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:27,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:27,624 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:27,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:35:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:27,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 20:35:27,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:27,841 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-02 20:35:27,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 20:35:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:35:28,004 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2023-12-02 20:35:28,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2023-12-02 20:35:28,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 20:35:28,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2023-12-02 20:35:28,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 20:35:28,807 INFO L349 Elim1Store]: treesize reduction 36, result has 43.8 percent of original size [2023-12-02 20:35:28,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 37 [2023-12-02 20:35:29,302 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-02 20:35:29,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2023-12-02 20:35:29,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:29,727 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2023-12-02 20:35:29,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 41 [2023-12-02 20:35:29,954 INFO L349 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2023-12-02 20:35:29,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 78 [2023-12-02 20:35:30,283 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2023-12-02 20:35:30,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 100 [2023-12-02 20:35:31,244 INFO L349 Elim1Store]: treesize reduction 145, result has 54.0 percent of original size [2023-12-02 20:35:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 104 treesize of output 236 [2023-12-02 20:35:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:54,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:36:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:36:17,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760481041] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:36:17,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:36:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 19] total 46 [2023-12-02 20:36:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577080191] [2023-12-02 20:36:17,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:36:17,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 20:36:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:36:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 20:36:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1925, Unknown=65, NotChecked=0, Total=2256 [2023-12-02 20:36:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:36:17,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:36:17,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 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) [2023-12-02 20:36:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:36:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:36:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:36:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:36:56,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:37:19,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:37:36,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:37:38,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:37:41,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:38:09,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:27,884 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 493 DAG size of output: 290 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:40:20,291 WARN L293 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 461 DAG size of output: 281 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:40:30,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:40:47,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:40:49,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:40:51,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:41:07,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:41:47,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:41:49,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:43:22,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:44:04,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:44:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:44:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:44:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-02 20:44:24,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:44:24,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 20:44:24,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:44:24,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:44:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash -863678800, now seen corresponding path program 1 times [2023-12-02 20:44:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:44:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645398860] [2023-12-02 20:44:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:44:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 20:44:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:44:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645398860] [2023-12-02 20:44:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645398860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:44:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:44:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 20:44:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120141654] [2023-12-02 20:44:25,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:44:25,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:44:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:44:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:44:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:44:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:25,234 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:44:25,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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) [2023-12-02 20:44:25,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:25,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:44:25,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:44:25,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2023-12-02 20:44:25,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:44:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:44:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-12-02 20:44:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:48,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 20:44:48,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:44:48,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:44:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2072682589, now seen corresponding path program 1 times [2023-12-02 20:44:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:44:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091675294] [2023-12-02 20:44:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:44:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:44:55,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:44:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091675294] [2023-12-02 20:44:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091675294] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:44:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682514858] [2023-12-02 20:44:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:44:55,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:44:55,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 20:44:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:55,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:44:55,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:44:55,916 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-12-02 20:44:55,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2023-12-02 20:44:55,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:44:56,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:56,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:44:56,219 INFO L378 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 31 treesize of output 12 [2023-12-02 20:44:56,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:44:56,518 INFO L378 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 49 treesize of output 49 [2023-12-02 20:44:56,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:44:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:56,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 20:44:56,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:44:57,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 20:44:57,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:44:57,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-02 20:44:57,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:44:57,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-02 20:44:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-02 20:44:57,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:44:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682514858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:44:57,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:44:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [24] total 31 [2023-12-02 20:44:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781273847] [2023-12-02 20:44:57,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:44:57,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:44:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:44:57,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:44:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2023-12-02 20:44:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:57,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:44:57,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) [2023-12-02 20:44:57,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:57,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:44:57,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:44:57,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2023-12-02 20:44:57,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:44:57,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:24,628 WARN L293 SmtUtils]: Spent 15.51s on a formula simplification. DAG size of input: 542 DAG size of output: 366 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:45:29,038 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse97 (select .cse2 |c_~#value~0.offset|))) (let ((.cse96 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse70 (mod .cse97 4294967296)) (.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (= .cse70 .cse0)) (.cse44 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse97)))) (.cse47 (= .cse96 .cse70)) (.cse46 (+ .cse96 1))) (and (or (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not .cse3)) (let ((.cse5 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1)))) (.cse6 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1)))) (.cse32 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1))))) (let ((.cse4 (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1)))))) (.cse7 (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))))) (.cse11 (and .cse6 .cse32)) (.cse12 (and .cse5 .cse32)) (.cse8 (= (select (select |c_#memory_int| 2) 0) 1)) (.cse9 (exists ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1)))) (or (and (or .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (exists ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int)) (and (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1) (not (= |thr1Thread3of3ForFork0_~#casret~0#1.base| 2)))) (and .cse8 .cse9 (let ((.cse10 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)))))) (or (and .cse6 .cse10) .cse11 (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1))))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1))))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)))) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1))))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))))))) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (exists ((v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))))))))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)))) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1)))) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (exists ((v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1)))))))) (and .cse5 .cse10) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (exists ((v_prenex_1 Int)) (and (exists ((v_prenex_2 Int)) (and (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)))))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)))) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)))) .cse12))) (and (let ((.cse31 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)))))) (let ((.cse20 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)) (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2))))) (.cse25 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (exists ((v_prenex_1 Int)) (and (exists ((v_prenex_2 Int)) (and (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)))) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|))))))) (.cse26 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (.cse29 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (.cse14 (and .cse31 .cse5)) (.cse28 (and .cse31 .cse6))) (let ((.cse19 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse30 (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|))) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select .cse30 0) 1) (= (select .cse30 |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1))))) (.cse13 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3))))) (.cse23 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1)))) (.cse24 (or .cse14 .cse5 .cse6 .cse28)) (.cse16 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) 0) 1)))) (.cse22 (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= 3 v_prenex_4))))) (.cse15 (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= 3 v_prenex_4)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3))))) (.cse21 (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 1) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 3)) (not (= v_prenex_3 0))))) (.cse27 (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= 3 v_prenex_4)) (not (= v_prenex_3 0))))) (.cse18 (or .cse20 .cse25 .cse26 .cse29)) (.cse17 (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= v_prenex_3 0)))))) (or (and .cse5 .cse13) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (exists ((v_prenex_1 Int)) (and (exists ((v_prenex_2 Int)) (and (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)))) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) .cse14 (and .cse15 .cse5) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) 0) 1) (exists ((v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))))))) (and .cse5 .cse16) .cse4 .cse5 (and .cse5 .cse17) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (and .cse17 .cse18) .cse6 (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)) (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))))))) (and .cse19 .cse6) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| 0)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (and .cse19 .cse5) (exists ((v_prenex_3 Int)) (and (exists ((v_prenex_4 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|))))))) (not (= v_prenex_3 0)))) .cse20 (and .cse6 .cse21) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (exists ((v_prenex_1 Int)) (and (exists ((v_prenex_2 Int)) (and (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)))) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= 3 v_prenex_4)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|))))) (not (= 3 v_prenex_4)))) (and .cse6 .cse22) (and .cse23 .cse6) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (and .cse17 .cse24) .cse25 (and .cse6 .cse13) (and .cse5 .cse23) .cse26 (and .cse27 .cse24) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_2 0)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))))) (and .cse6 .cse16) .cse28 (and .cse5 .cse22) (and .cse15 .cse6) (exists ((v_prenex_3 Int)) (and (exists ((v_prenex_4 Int)) (and (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|))))) (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1))) (not (= v_prenex_3 0)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|))))) (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= 3 v_prenex_4)))) (and .cse5 .cse21) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (= (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) 0) 1) (exists ((v_prenex_1 Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_1)) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1)))))) .cse7 (exists ((v_prenex_3 Int)) (and (exists ((v_prenex_4 Int)) (and (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)) (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (exists ((v_prenex_1 Int)) (and (exists ((v_prenex_2 Int)) (and (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))) (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)))) (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)))))) (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1))) (not (= v_prenex_3 0)))) (exists ((v_prenex_3 Int)) (and (exists ((v_prenex_4 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)) (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)))))) (not (= v_prenex_3 0)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= (select (select |c_#memory_int| v_prenex_4) v_prenex_3) 1) (not (= 3 v_prenex_4)) (exists ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| Int)) (and (exists ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (and (= 2 (select (select |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|)) (exists ((v_prenex_1 Int)) (and (not (= 3 v_prenex_1)) (not (= 2 v_prenex_1)) (exists ((v_prenex_2 Int)) (and (not (= v_prenex_2 0)) (= (select (select |c_#memory_int| v_prenex_1) v_prenex_2) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.offset| v_prenex_2)))))))) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| 2)) (not (= |v_thr1Thread1of3ForFork0_~#casret~0#1.base_16| v_prenex_4)))))) .cse29 (and .cse27 .cse18) (and .cse6 .cse17))))) .cse8 .cse9) (and (or .cse11 .cse5 .cse6 .cse12) .cse8 .cse9)))) (= (select |c_#valid| 3) 1) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (<= |c_thr1Thread3of3ForFork0_~v~0#1| (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) 4294967294)) (= (select (select |c_#memory_int| 3) 0) 3) (or (forall ((v_DerPreprocessor_8 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (v_ArrVal_452 Int) (v_ArrVal_460 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| Int) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_459 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse43 (store (select .cse44 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse42 (select (store (store .cse44 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| .cse43) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_453) |c_~#value~0.base|))) (let ((.cse40 (select .cse42 |c_~#value~0.offset|))) (let ((.cse35 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| .cse43)) (.cse41 (store .cse42 |c_~#value~0.offset| (+ .cse40 1)))) (let ((.cse39 (store (store .cse35 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_453) |c_~#value~0.base| .cse41))) (let ((.cse36 (store (select .cse39 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) 0 1))) (let ((.cse37 (select (store (store (store .cse35 |c_~#value~0.base| .cse41) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse36) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base|))) (let ((.cse38 (select .cse37 |c_~#value~0.offset|))) (let ((.cse33 (mod .cse38 4294967296))) (or (< .cse33 (mod (select (select (let ((.cse34 (store (store (store .cse35 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse36) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| (+ .cse38 1))))) (store .cse34 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse34 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| v_ArrVal_452) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (< (mod (select (select (store .cse39 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse36) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse40 4294967296) 1)) (= 4294967295 .cse33)))))))))))) (= |c_thr1Thread3of3ForFork0_~v~0#1| 2) (let ((.cse53 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (let ((.cse50 (store (select .cse53 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse45 (store .cse53 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse50))) (or (< (mod (select (select .cse45 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse46) (not .cse47) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse51 (select (store .cse45 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base|))) (let ((.cse52 (select .cse51 |c_~#value~0.offset|))) (let ((.cse48 (mod .cse52 4294967296))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (= .cse48 4294967295) (< .cse48 (mod (select (select (let ((.cse49 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse50) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base| (store .cse51 |c_~#value~0.offset| (+ .cse52 1))))) (store .cse49 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse49 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_460 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| Int) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_453))) (let ((.cse63 (select .cse62 |c_~#value~0.base|))) (let ((.cse56 (select .cse63 |c_~#value~0.offset|))) (let ((.cse61 (store .cse63 |c_~#value~0.offset| (+ .cse56 1)))) (let ((.cse54 (store .cse62 |c_~#value~0.base| .cse61))) (let ((.cse55 (store (select .cse54 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) 0 1))) (let ((.cse59 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse61) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse55) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base|))) (let ((.cse60 (select .cse59 |c_~#value~0.offset|))) (let ((.cse57 (mod .cse60 4294967296))) (or (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (< (mod (select (select (store .cse54 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse55) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse56 4294967296) 1)) (< .cse57 (mod (select (select (let ((.cse58 (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse55) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base| (store .cse59 |c_~#value~0.offset| (+ .cse60 1))))) (store .cse58 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse58 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse57 4294967295)))))))))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (= (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1) |c_thr1Thread3of3ForFork0_~vn~0#1|) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_460 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| Int) (v_ArrVal_459 Int)) (let ((.cse66 (store (select .cse44 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) 0 1))) (let ((.cse69 (store .cse44 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse66))) (let ((.cse67 (select (store .cse69 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base|))) (let ((.cse68 (select .cse67 |c_~#value~0.offset|))) (let ((.cse64 (mod .cse68 4294967296))) (or (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (= 4294967295 .cse64) (< .cse64 (mod (select (select (let ((.cse65 (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse66) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base| (store .cse67 |c_~#value~0.offset| (+ .cse68 1))))) (store .cse65 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse65 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< (mod (select (select .cse69 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ .cse70 1))))))))) (or .cse47 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse76 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9))) (let ((.cse73 (store .cse76 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460))) (let ((.cse74 (select .cse73 |c_~#value~0.base|))) (let ((.cse75 (select .cse74 |c_~#value~0.offset|))) (let ((.cse71 (mod .cse75 4294967296))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (= 4294967295 .cse71) (< .cse71 (mod (select (select (let ((.cse72 (store .cse73 |c_~#value~0.base| (store .cse74 |c_~#value~0.offset| (+ .cse75 1))))) (store .cse72 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse72 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< (mod (select (select .cse76 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse46))))))))) (forall ((v_ArrVal_446 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (v_ArrVal_452 Int) (v_ArrVal_460 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| Int) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_459 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_446))) (let ((.cse88 (let ((.cse90 (select .cse89 |c_~#value~0.base|))) (store .cse90 |c_~#value~0.offset| (+ (select .cse90 |c_~#value~0.offset|) 1))))) (let ((.cse87 (store (select (store .cse89 |c_~#value~0.base| .cse88) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse86 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse88) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| .cse87) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_453) |c_~#value~0.base|))) (let ((.cse84 (select .cse86 |c_~#value~0.offset|))) (let ((.cse79 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| .cse87)) (.cse85 (store .cse86 |c_~#value~0.offset| (+ .cse84 1)))) (let ((.cse83 (store (store .cse79 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_453) |c_~#value~0.base| .cse85))) (let ((.cse80 (store (select .cse83 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) 0 1))) (let ((.cse81 (select (store (store (store .cse79 |c_~#value~0.base| .cse85) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse80) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base|))) (let ((.cse82 (select .cse81 |c_~#value~0.offset|))) (let ((.cse77 (mod .cse82 4294967296))) (or (< .cse77 (mod (select (select (let ((.cse78 (store (store (store .cse79 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse80) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460) |c_~#value~0.base| (store .cse81 |c_~#value~0.offset| (+ .cse82 1))))) (store .cse78 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse78 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| v_ArrVal_452) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (< (mod (select (select (store .cse83 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse80) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse84 4294967296) 1)) (= .cse77 4294967295)))))))))))))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_460))) (let ((.cse94 (select .cse93 |c_~#value~0.base|))) (let ((.cse95 (select .cse94 |c_~#value~0.offset|))) (let ((.cse91 (mod .cse95 4294967296))) (or (< .cse91 (mod (select (select (let ((.cse92 (store .cse93 |c_~#value~0.base| (store .cse94 |c_~#value~0.offset| (+ .cse95 1))))) (store .cse92 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select .cse92 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_459) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (= 4294967295 .cse91))))))) (< .cse70 .cse46))))))) is different from true [2023-12-02 20:45:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:45:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:45:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-02 20:45:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:45:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:45:31,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 20:45:31,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 20:45:31,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:45:31,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1888474259, now seen corresponding path program 2 times [2023-12-02 20:45:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858002741] [2023-12-02 20:45:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 1 proven. 73 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:45:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858002741] [2023-12-02 20:45:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858002741] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:45:49,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635534361] [2023-12-02 20:45:49,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:45:49,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:45:49,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:45:49,653 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:45:49,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:45:49,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:45:49,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:45:49,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 20:45:49,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:45:50,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-12-02 20:45:50,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-12-02 20:45:50,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 20:45:50,306 INFO L378 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 36 treesize of output 17 [2023-12-02 20:45:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:45:50,909 INFO L378 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 60 treesize of output 52 [2023-12-02 20:45:50,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:45:50,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 20:45:50,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:45:50,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 20:45:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:45:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 20:45:51,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:45:51,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635534361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:51,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:45:51,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [44] total 48 [2023-12-02 20:45:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588170184] [2023-12-02 20:45:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:51,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:45:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:45:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2045, Unknown=0, NotChecked=0, Total=2256 [2023-12-02 20:45:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,351 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:51,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2023-12-02 20:45:51,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:45:51,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:45:51,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2023-12-02 20:45:51,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:45:51,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:45:51,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 20:45:53,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 20:45:53,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:45:53,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 165588778, now seen corresponding path program 1 times [2023-12-02 20:45:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659522709] [2023-12-02 20:45:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:05,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659522709] [2023-12-02 20:46:05,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659522709] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:05,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849142541] [2023-12-02 20:46:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:05,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:05,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:05,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:05,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e1e5f0-38ba-4c95-92cc-282cc5ec1918/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 20:46:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:06,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 20:46:06,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:06,268 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:46:06,268 INFO L378 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 19 treesize of output 16 [2023-12-02 20:46:06,731 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:46:06,731 INFO L378 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 19 treesize of output 16 [2023-12-02 20:46:07,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:07,514 INFO L378 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 14 treesize of output 14 [2023-12-02 20:46:07,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:46:07,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 20:46:08,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:46:08,635 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:46:08,635 INFO L378 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 [2023-12-02 20:46:09,468 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:46:09,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:46:10,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 20:46:10,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:46:11,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2023-12-02 20:46:11,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:46:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:46:12,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:15,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|)) (.cse2 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse3 (not .cse2)) (.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (let ((.cse1 (forall ((v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_22 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (.cse5 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (and (or .cse1 .cse2) (or .cse3 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int))) (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (not .cse5)) (or .cse1 .cse5 .cse2)))) (or (and (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25) |c_~#value~0.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse2) (or .cse3 (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_25) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse0)))) is different from false [2023-12-02 20:46:16,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:16,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:16,083 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:16,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 3 times theorem prover too weak. 2 trivial. 2 not checked. [2023-12-02 20:46:20,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849142541] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:20,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:20,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 12] total 55 [2023-12-02 20:46:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650238126] [2023-12-02 20:46:20,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:20,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 20:46:20,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 20:46:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2691, Unknown=5, NotChecked=106, Total=3080 [2023-12-02 20:46:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:20,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:20,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.375) internal successors, (133), 55 states have internal predecessors, (133), 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) [2023-12-02 20:46:20,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:20,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:46:20,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:46:20,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2023-12-02 20:46:20,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:20,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:46:20,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:20,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.