./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --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_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/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_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/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_175aaa74-0814-4b6b-90be-4ee48270a363/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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:13:22,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:13:22,072 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-12-02 20:13:22,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:13:22,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:13:22,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:13:22,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:13:22,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:13:22,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:13:22,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:13:22,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:13:22,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:13:22,102 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:13:22,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:13:22,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:13:22,104 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:13:22,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:13:22,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:13:22,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:13:22,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:13:22,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:13:22,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:13:22,107 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:13:22,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:13:22,108 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:13:22,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:13:22,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:13:22,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:13:22,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:13:22,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:13:22,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:13:22,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:13:22,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:13:22,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:13:22,113 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:13:22,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:13:22,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:13:22,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:13:22,114 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:13:22,114 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:13:22,114 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:13:22,114 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_175aaa74-0814-4b6b-90be-4ee48270a363/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_175aaa74-0814-4b6b-90be-4ee48270a363/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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2023-12-02 20:13:22,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:13:22,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:13:22,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:13:22,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:13:22,342 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:13:22,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2023-12-02 20:13:25,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:13:25,327 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:13:25,328 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2023-12-02 20:13:25,335 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/data/c164fb3c6/92a2cfe6e74641d5b52b0f1a1be882b8/FLAG14f7acead [2023-12-02 20:13:25,348 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/data/c164fb3c6/92a2cfe6e74641d5b52b0f1a1be882b8 [2023-12-02 20:13:25,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:13:25,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:13:25,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:13:25,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:13:25,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:13:25,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429985b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25, skipping insertion in model container [2023-12-02 20:13:25,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,386 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:13:25,564 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_175aaa74-0814-4b6b-90be-4ee48270a363/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2500,2513] [2023-12-02 20:13:25,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:13:25,587 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:13:25,610 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_175aaa74-0814-4b6b-90be-4ee48270a363/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2500,2513] [2023-12-02 20:13:25,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:13:25,628 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:13:25,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25 WrapperNode [2023-12-02 20:13:25,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:13:25,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:13:25,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:13:25,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:13:25,635 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:13:25" (1/1) ... [2023-12-02 20:13:25,643 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:13:25" (1/1) ... [2023-12-02 20:13:25,671 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 146 [2023-12-02 20:13:25,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:13:25,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:13:25,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:13:25,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:13:25,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:13:25,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:13:25,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:13:25,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:13:25,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (1/1) ... [2023-12-02 20:13:25,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:13:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:13:25,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/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:13:25,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/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:13:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:13:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 20:13:25,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 20:13:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 20:13:25,775 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 20:13:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:13:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:13:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:13:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:13:25,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:13:25,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:13:25,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:13:25,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:13:25,778 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:13:25,885 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:13:25,887 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:13:26,150 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:13:26,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:13:26,390 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 20:13:26,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:13:26 BoogieIcfgContainer [2023-12-02 20:13:26,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:13:26,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:13:26,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:13:26,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:13:26,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:13:25" (1/3) ... [2023-12-02 20:13:26,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186ccab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:13:26, skipping insertion in model container [2023-12-02 20:13:26,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:13:25" (2/3) ... [2023-12-02 20:13:26,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186ccab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:13:26, skipping insertion in model container [2023-12-02 20:13:26,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:13:26" (3/3) ... [2023-12-02 20:13:26,399 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2023-12-02 20:13:26,407 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:13:26,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:13:26,418 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:13:26,418 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:13:26,458 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:13:26,496 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:13:26,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:13:26,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:13:26,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:13:26,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:13:26,537 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:13:26,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:13:26,558 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;@3101e0a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:13:26,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-02 20:13:26,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:13:26,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:13:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -701037702, now seen corresponding path program 1 times [2023-12-02 20:13:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:13:26,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963315388] [2023-12-02 20:13:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:13:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:13:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:13:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963315388] [2023-12-02 20:13:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963315388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:13:27,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:13:27,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:13:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678129409] [2023-12-02 20:13:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:13:27,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:13:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:13:27,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:13:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:13:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:27,084 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:13:27,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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:13:27,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:27,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:13:27,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:13:27,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:13:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash -973005165, now seen corresponding path program 1 times [2023-12-02 20:13:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:13:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087735782] [2023-12-02 20:13:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:13:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:13:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:13:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087735782] [2023-12-02 20:13:27,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087735782] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:13:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86817343] [2023-12-02 20:13:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:13:27,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:13:27,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:13:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:27,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 20:13:27,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:13:28,005 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 40 treesize of output 32 [2023-12-02 20:13:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:13:28,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:13:28,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:13:28,187 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 52 treesize of output 37 [2023-12-02 20:13:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:13:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86817343] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:13:28,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:13:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2023-12-02 20:13:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024913794] [2023-12-02 20:13:28,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:13:28,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:13:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:13:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:13:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:13:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:28,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:13:28,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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:13:28,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:28,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:13:28,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 20:13:28,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:28,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:13:28,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:13:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1766910902, now seen corresponding path program 1 times [2023-12-02 20:13:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:13:28,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788143520] [2023-12-02 20:13:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:13:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:13:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:13:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788143520] [2023-12-02 20:13:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788143520] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:13:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550695635] [2023-12-02 20:13:29,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:29,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:13:29,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:13:29,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:13:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:29,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 20:13:29,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:13:30,246 INFO L349 Elim1Store]: treesize reduction 27, result has 52.6 percent of original size [2023-12-02 20:13:30,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 96 [2023-12-02 20:13:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:13:30,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:13:30,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:13:30,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 161 treesize of output 177 [2023-12-02 20:13:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:13:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550695635] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:13:34,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:13:34,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 23 [2023-12-02 20:13:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169680704] [2023-12-02 20:13:34,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:13:34,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 20:13:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:13:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 20:13:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-12-02 20:13:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:34,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:13:34,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 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:13:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:13:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:13:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:13:34,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:13:34,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:34,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:13:34,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:13:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash -107459075, now seen corresponding path program 2 times [2023-12-02 20:13:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:13:34,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480646929] [2023-12-02 20:13:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:13:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:13:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:13:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480646929] [2023-12-02 20:13:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480646929] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:13:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432997496] [2023-12-02 20:13:36,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:13:36,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:36,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:13:36,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:13:36,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:13:36,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:13:36,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:13:36,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 20:13:36,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:13:36,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:13:36,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 71 [2023-12-02 20:13:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:13:36,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:13:36,874 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2023-12-02 20:13:36,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2023-12-02 20:13:36,964 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2023-12-02 20:13:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 61 [2023-12-02 20:13:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:13:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432997496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:13:37,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:13:37,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 28 [2023-12-02 20:13:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072458117] [2023-12-02 20:13:37,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:13:37,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 20:13:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:13:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 20:13:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2023-12-02 20:13:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:37,228 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:13:37,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 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:13:37,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:37,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:13:37,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:13:37,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:13:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:13:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:13:38,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:13:38,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:38,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:13:38,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:13:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2100193803, now seen corresponding path program 3 times [2023-12-02 20:13:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:13:38,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741384495] [2023-12-02 20:13:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:13:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:13:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:13:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:13:39,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:13:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741384495] [2023-12-02 20:13:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741384495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:13:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336188273] [2023-12-02 20:13:39,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:13:39,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:13:39,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:13:39,420 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:13:39,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:13:39,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 20:13:39,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:13:39,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 20:13:39,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:13:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:13:39,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:13:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:13:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336188273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:13:40,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:13:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2023-12-02 20:13:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624462764] [2023-12-02 20:13:40,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:13:40,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 20:13:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:13:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 20:13:40,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2023-12-02 20:13:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:13:40,282 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:13:40,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 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:13:40,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:13:40,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:13:40,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:13:40,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:13:40,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:14:17,004 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 64 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:14:18,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:14:34,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:14:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:14:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:14:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:14:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:14:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:14:41,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:14:41,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:14:41,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:14:41,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:14:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1728375167, now seen corresponding path program 4 times [2023-12-02 20:14:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:14:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923568769] [2023-12-02 20:14:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:14:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:14:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:14:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:14:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:14:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923568769] [2023-12-02 20:14:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923568769] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:14:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105209708] [2023-12-02 20:14:42,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 20:14:42,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:14:42,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:14:42,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:14:42,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175aaa74-0814-4b6b-90be-4ee48270a363/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:14:42,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 20:14:42,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:14:42,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 20:14:42,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:14:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:14:43,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:14:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:14:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105209708] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:14:49,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:14:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 50 [2023-12-02 20:14:49,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448220241] [2023-12-02 20:14:49,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:14:49,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 20:14:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:14:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 20:14:49,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 20:14:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:14:49,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:14:49,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.42) internal successors, (71), 50 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:14:49,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:14:49,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:14:49,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:14:49,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:14:49,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:14:49,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:16:55,139 WARN L293 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 92 DAG size of output: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:16:57,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse19 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse19)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse18 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse20 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse11 (+ .cse15 2)) (.cse21 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse22 (+ .cse6 2)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse17 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (.cse14 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (let ((.cse16 (mod (+ 4294967295 c_~n~0) 4294967296))) (or (< .cse14 (mod c_~n~0 4294967296)) (< .cse15 .cse16) (< .cse16 (+ .cse17 1)))) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse18) (< .cse19 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse18) (< .cse19 .cse10)) (or (< .cse20 14) (< 14 .cse7)) (or (< .cse21 .cse7) (< .cse20 .cse22)) (or (< .cse12 .cse14) (< .cse13 .cse11)) (or (< .cse21 .cse4) (< .cse7 .cse22)) (or (< .cse13 (+ 2 .cse17)) (< .cse15 .cse14))))) is different from false [2023-12-02 20:17:27,032 WARN L293 SmtUtils]: Spent 14.40s on a formula simplification. DAG size of input: 110 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:17:29,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse18)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse17 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse19 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse11 (+ .cse15 2)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse21 (+ .cse6 2))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (let ((.cse16 (mod (+ 4294967295 c_~n~0) 4294967296))) (or (< .cse14 (mod c_~n~0 4294967296)) (< .cse15 .cse16) (< .cse16 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1)))) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse17) (< .cse18 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse17) (< .cse18 .cse10)) (or (< .cse19 14) (< 14 .cse7)) (or (< .cse20 .cse7) (< .cse19 .cse21)) (or (< .cse12 .cse14) (< .cse13 .cse11)) (or (< .cse20 .cse4) (< .cse7 .cse21))))) is different from false [2023-12-02 20:17:43,339 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 103 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:18:06,987 WARN L293 SmtUtils]: Spent 13.70s on a formula simplification. DAG size of input: 116 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:18:26,996 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 109 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:18:55,319 WARN L293 SmtUtils]: Spent 9.22s on a formula simplification. DAG size of input: 134 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:19:17,980 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 121 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:19:37,708 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 121 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:19:39,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse28 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse0 (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)) (.cse17 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse19 (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse26 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4)) (.cse21 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse13 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse1 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse10 (+ .cse13 2)) (.cse6 (+ 2 .cse21)) (.cse5 (mod .cse26 4294967296)) (.cse14 (+ 2 .cse7)) (.cse8 (mod .cse19 4294967296)) (.cse20 (+ 2 .cse17)) (.cse15 (mod .cse0 4294967296)) (.cse2 (div c_~n~0 4294967296)) (.cse4 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)) (.cse22 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse16 (+ .cse28 2)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse9 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse12 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse24 (+ .cse11 2)) (.cse18 (mod .cse25 4294967296)) (.cse27 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (<= .cse0 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= 0 .cse1) (let ((.cse3 (* 4294967296 .cse1))) (or (< (+ (* 4294967296 .cse2) |c_thread1Thread1of1ForFork1_~i~0#1| 4) (+ .cse3 c_~n~0)) (< (+ .cse3 (* 4294967296 (div (+ 4294967295 c_~n~0) 4294967296)) 1) (+ (* (div (+ .cse4 c_~n~0 11) 4294967296) 4294967296) |c_thread2Thread1of1ForFork0_~i~1#1|)))) (or (< .cse5 .cse6) (< .cse7 .cse8)) (<= .cse2 (div (+ 7 .cse4 c_~n~0) 4294967296)) (or (< .cse9 .cse10) (< .cse11 .cse5)) (or (< .cse11 .cse9) (< .cse12 .cse10)) (or (< .cse13 .cse5) (< .cse9 .cse14)) (or (< .cse15 .cse16) (< .cse17 .cse18)) (<= .cse2 (div (+ 5 .cse4 c_~n~0) 4294967296)) (or (< .cse7 .cse15) (< .cse8 .cse6)) (<= .cse19 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= .cse2 (div (+ .cse4 c_~n~0 1) 4294967296)) (or (< .cse15 .cse20) (< .cse21 .cse18)) (or (< .cse5 .cse14) (< .cse13 .cse8)) (or (< .cse8 .cse20) (< .cse21 .cse15)) (<= 3 |c_thread1Thread1of1ForFork1_~i~0#1|) (<= |c_thread1Thread1of1ForFork1_~i~0#1| |c_thread2Thread1of1ForFork0_~i~1#1|) (or (< .cse22 14) (< 14 .cse12)) (<= .cse2 (div (+ 3 .cse4 c_~n~0) 4294967296)) (or (< .cse23 .cse12) (< .cse22 .cse24)) (<= .cse25 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= .cse26 |c_thread2Thread1of1ForFork0_~i~1#1|) (or (< .cse17 .cse27) (< .cse18 .cse16)) (<= 1 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< .cse23 .cse9) (< .cse12 .cse24)) (<= 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< .cse18 (+ 2 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< .cse28 .cse27)) (<= 4 |c_thread1Thread1of1ForFork1_~i~0#1|)))) is different from false [2023-12-02 20:20:00,063 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 126 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:20:18,274 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 126 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:20:40,206 WARN L293 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 145 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:20:59,913 WARN L293 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 123 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:21:21,979 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse17 (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|)) (.cse27 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse0 (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse18 (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|)) (.cse3 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse25 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse8 (+ .cse11 2)) (.cse2 (+ 2 .cse20)) (.cse1 (mod .cse25 4294967296)) (.cse12 (+ 2 .cse3)) (.cse4 (mod .cse18 4294967296)) (.cse19 (+ 2 .cse15)) (.cse13 (mod .cse0 4294967296)) (.cse5 (div c_~n~0 4294967296)) (.cse6 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)) (.cse21 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (+ .cse27 2)) (.cse22 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse7 (mod .cse17 4294967296)) (.cse10 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse23 (+ .cse9 2)) (.cse16 (mod .cse24 4294967296)) (.cse26 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (<= .cse0 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= 6 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< .cse1 .cse2) (< .cse3 .cse4)) (<= 5 |c_thread1Thread1of1ForFork1_~i~0#1|) (<= .cse5 (div (+ 7 .cse6 c_~n~0) 4294967296)) (or (< .cse7 .cse8) (< .cse9 .cse1)) (or (< .cse9 .cse7) (< .cse10 .cse8)) (or (< .cse11 .cse1) (< .cse7 .cse12)) (<= (+ (* 4294967296 .cse5) |c_thread1Thread1of1ForFork1_~i~0#1| (* 4294967296 (div (+ 4294967295 c_~n~0) 4294967296))) (+ (* (div (+ .cse6 c_~n~0 11) 4294967296) 4294967296) 4294967290 c_~n~0 (* 4294967296 (div (+ (- 2) |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296)))) (or (< .cse13 .cse14) (< .cse15 .cse16)) (<= .cse5 (div (+ 5 .cse6 c_~n~0) 4294967296)) (or (< .cse3 .cse13) (< .cse4 .cse2)) (<= .cse17 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= .cse18 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= .cse5 (div (+ .cse6 c_~n~0 1) 4294967296)) (or (< .cse13 .cse19) (< .cse20 .cse16)) (or (< .cse1 .cse12) (< .cse11 .cse4)) (or (< .cse4 .cse19) (< .cse20 .cse13)) (<= 3 |c_thread1Thread1of1ForFork1_~i~0#1|) (<= .cse5 (div (+ 9 .cse6 c_~n~0) 4294967296)) (<= |c_thread1Thread1of1ForFork1_~i~0#1| |c_thread2Thread1of1ForFork0_~i~1#1|) (or (< .cse21 14) (< 14 .cse10)) (<= .cse5 (div (+ 3 .cse6 c_~n~0) 4294967296)) (or (< .cse22 .cse10) (< .cse21 .cse23)) (<= .cse24 |c_thread2Thread1of1ForFork0_~i~1#1|) (<= .cse25 |c_thread2Thread1of1ForFork0_~i~1#1|) (or (< .cse15 .cse26) (< .cse16 .cse14)) (<= 1 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< .cse22 .cse7) (< .cse10 .cse23)) (<= 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< .cse16 (+ 2 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< .cse27 .cse26)) (<= 4 |c_thread1Thread1of1ForFork1_~i~0#1|)))) is different from false [2023-12-02 20:21:41,049 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 129 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:23:04,246 WARN L293 SmtUtils]: Spent 42.34s on a formula simplification. DAG size of input: 140 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:23:27,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:24:14,409 WARN L293 SmtUtils]: Spent 19.77s on a formula simplification. DAG size of input: 120 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:24:15,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:24:17,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:24:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:24:21,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:24:24,220 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 [] [2023-12-02 20:25:08,896 WARN L293 SmtUtils]: Spent 19.03s on a formula simplification. DAG size of input: 134 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:25:11,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 20:25:54,236 WARN L293 SmtUtils]: Spent 13.76s on a formula simplification. DAG size of input: 134 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:26:22,771 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 92 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:27:00,425 WARN L293 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 108 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:27:35,736 WARN L293 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 118 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:28:29,067 WARN L293 SmtUtils]: Spent 22.29s on a formula simplification. DAG size of input: 103 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:28:33,061 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 [] [2023-12-02 20:28:35,066 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 []