./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL --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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:04:57,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:04:58,152 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-08 12:04:58,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:04:58,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:04:58,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:04:58,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:04:58,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:04:58,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:04:58,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:04:58,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:04:58,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:04:58,196 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:04:58,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:04:58,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:04:58,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:04:58,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:04:58,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:04:58,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:04:58,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:04:58,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:04:58,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:04:58,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:04:58,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:04:58,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:04:58,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:04:58,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:04:58,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:04:58,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:04:58,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:04:58,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:04:58,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:04:58,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:04:58,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:04:58,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:04:58,209 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-08 12:04:58,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:04:58,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:04:58,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:04:58,214 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:04:58,214 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:04:58,215 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_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/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_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2024-11-08 12:04:58,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:04:58,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:04:58,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:04:58,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:04:58,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:04:58,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/pthread/triangular-longest-2.i Unable to find full path for "g++" [2024-11-08 12:05:01,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:05:01,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:05:01,505 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/sv-benchmarks/c/pthread/triangular-longest-2.i [2024-11-08 12:05:01,531 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/data/420ebc77e/650664c63ca347b79f6b60a6aa924feb/FLAGb75495280 [2024-11-08 12:05:01,557 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/data/420ebc77e/650664c63ca347b79f6b60a6aa924feb [2024-11-08 12:05:01,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:05:01,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:05:01,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:05:01,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:05:01,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:05:01,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:05:01" (1/1) ... [2024-11-08 12:05:01,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f465454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:01, skipping insertion in model container [2024-11-08 12:05:01,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:05:01" (1/1) ... [2024-11-08 12:05:01,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:05:02,193 WARN L250 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_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2024-11-08 12:05:02,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:05:02,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:05:02,282 WARN L250 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_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2024-11-08 12:05:02,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:05:02,345 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:05:02,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02 WrapperNode [2024-11-08 12:05:02,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:05:02,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:05:02,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:05:02,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:05:02,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,417 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-08 12:05:02,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:05:02,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:05:02,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:05:02,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:05:02,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:05:02,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:05:02,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:05:02,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:05:02,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (1/1) ... [2024-11-08 12:05:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:05:02,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:05:02,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:05:02,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:05:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-08 12:05:02,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-08 12:05:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-08 12:05:02,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-08 12:05:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 12:05:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:05:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:05:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 12:05:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:05:02,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:05:02,564 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:05:02,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:05:02,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:05:03,020 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:05:03,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:05:03,150 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:05:03,150 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:05:03,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:05:03 BoogieIcfgContainer [2024-11-08 12:05:03,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:05:03,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:05:03,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:05:03,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:05:03,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:05:01" (1/3) ... [2024-11-08 12:05:03,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a550a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:05:03, skipping insertion in model container [2024-11-08 12:05:03,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:05:02" (2/3) ... [2024-11-08 12:05:03,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a550a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:05:03, skipping insertion in model container [2024-11-08 12:05:03,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:05:03" (3/3) ... [2024-11-08 12:05:03,161 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-11-08 12:05:03,185 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:05:03,186 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:05:03,186 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:05:03,268 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:05:03,351 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:05:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:05:03,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:05:03,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:05:03,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:05:03,402 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:05:03,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:05:03,431 INFO L333 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, 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;@3152bd98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:05:03,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-08 12:05:03,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash 697625493, now seen corresponding path program 1 times [2024-11-08 12:05:03,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242691649] [2024-11-08 12:05:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:05:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:05:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242691649] [2024-11-08 12:05:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242691649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:05:04,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:05:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:05:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370278492] [2024-11-08 12:05:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:05:04,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:05:04,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:05:04,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:05:04,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:05:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:04,667 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:05:04,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2024-11-08 12:05:04,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:05,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:05:05,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:05,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 956008623, now seen corresponding path program 1 times [2024-11-08 12:05:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:05,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904211728] [2024-11-08 12:05:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:05:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:05,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:05:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904211728] [2024-11-08 12:05:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904211728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:05:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:05:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:05:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054019225] [2024-11-08 12:05:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:05:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:05:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:05:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:05:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:05:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:05,177 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:05:05,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2024-11-08 12:05:05,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:05,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:05,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:05:05,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:05,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1053513613, now seen corresponding path program 1 times [2024-11-08 12:05:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878031735] [2024-11-08 12:05:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:05:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:05,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:05:05,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878031735] [2024-11-08 12:05:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878031735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:05:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:05:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:05:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702373495] [2024-11-08 12:05:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:05:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 12:05:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:05:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 12:05:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:05:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:05,649 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:05:05,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-11-08 12:05:05,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:05,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:05,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:06,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:05:06,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -88978555, now seen corresponding path program 2 times [2024-11-08 12:05:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563848330] [2024-11-08 12:05:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:05:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:06,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:05:06,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563848330] [2024-11-08 12:05:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563848330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:05:06,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786962420] [2024-11-08 12:05:06,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:05:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:05:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:05:06,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:05:06,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:05:06,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:05:06,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:05:06,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:05:06,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:05:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:06,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:05:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786962420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:05:07,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:05:07,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-08 12:05:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575961525] [2024-11-08 12:05:07,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:05:07,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 12:05:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:05:07,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 12:05:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:05:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:07,236 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:05:07,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 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) [2024-11-08 12:05:07,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:07,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:07,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:07,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:05:08,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:05:08,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:05:08,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1815762797, now seen corresponding path program 3 times [2024-11-08 12:05:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833491728] [2024-11-08 12:05:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:05:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:08,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:05:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833491728] [2024-11-08 12:05:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833491728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:05:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286962857] [2024-11-08 12:05:08,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:05:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:05:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:05:08,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:05:08,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:05:08,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-08 12:05:08,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:05:08,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 12:05:08,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:05:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:09,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:05:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286962857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:05:09,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:05:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-11-08 12:05:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14490574] [2024-11-08 12:05:09,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:05:09,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 12:05:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:05:09,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 12:05:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2024-11-08 12:05:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:09,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:05:09,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 27 states have internal predecessors, (108), 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) [2024-11-08 12:05:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:05:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:05:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 12:05:11,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:05:11,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:05:11,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:11,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1689306941, now seen corresponding path program 4 times [2024-11-08 12:05:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170198801] [2024-11-08 12:05:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:05:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:05:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170198801] [2024-11-08 12:05:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170198801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:05:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162305492] [2024-11-08 12:05:12,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 12:05:12,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:05:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:05:12,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:05:12,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:05:12,949 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 12:05:12,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:05:12,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 12:05:12,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:05:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:13,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:05:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:05:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162305492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:05:15,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:05:15,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2024-11-08 12:05:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483020998] [2024-11-08 12:05:15,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:05:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 12:05:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:05:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 12:05:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=2041, Unknown=0, NotChecked=0, Total=2652 [2024-11-08 12:05:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:15,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:05:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.9423076923076925) internal successors, (205), 51 states have internal predecessors, (205), 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) [2024-11-08 12:05:15,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:15,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:15,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:15,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:05:15,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-08 12:05:15,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:05:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:05:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:05:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:05:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:05:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 12:05:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 12:05:18,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:05:18,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 12:05:18,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-08 12:05:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:05:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash -918926603, now seen corresponding path program 5 times [2024-11-08 12:05:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:05:18,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453742607] [2024-11-08 12:05:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:05:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:05:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:05:18,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:05:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:05:18,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:05:18,980 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:05:18,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-08 12:05:18,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-08 12:05:18,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-08 12:05:18,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:05:18,997 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-11-08 12:05:19,190 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 12:05:19,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:05:19,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-08 12:05:19,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:05:19 BasicIcfg [2024-11-08 12:05:19,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:05:19,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:05:19,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:05:19,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:05:19,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:05:03" (3/4) ... [2024-11-08 12:05:19,226 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 12:05:19,426 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/witness.graphml [2024-11-08 12:05:19,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:05:19,427 INFO L158 Benchmark]: Toolchain (without parser) took 17863.11ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 134.8MB in the beginning and 185.0MB in the end (delta: -50.1MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,427 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:05:19,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 781.30ms. Allocated memory is still 165.7MB. Free memory was 134.8MB in the beginning and 112.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.31ms. Allocated memory is still 165.7MB. Free memory was 112.2MB in the beginning and 110.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,429 INFO L158 Benchmark]: Boogie Preprocessor took 39.72ms. Allocated memory is still 165.7MB. Free memory was 110.3MB in the beginning and 108.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,429 INFO L158 Benchmark]: RCFGBuilder took 691.35ms. Allocated memory is still 165.7MB. Free memory was 108.9MB in the beginning and 123.7MB in the end (delta: -14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,429 INFO L158 Benchmark]: TraceAbstraction took 16068.67ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 122.7MB in the beginning and 215.9MB in the end (delta: -93.3MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,430 INFO L158 Benchmark]: Witness Printer took 203.84ms. Allocated memory is still 287.3MB. Free memory was 215.9MB in the beginning and 185.0MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 12:05:19,432 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 781.30ms. Allocated memory is still 165.7MB. Free memory was 134.8MB in the beginning and 112.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.31ms. Allocated memory is still 165.7MB. Free memory was 112.2MB in the beginning and 110.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.72ms. Allocated memory is still 165.7MB. Free memory was 110.3MB in the beginning and 108.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 691.35ms. Allocated memory is still 165.7MB. Free memory was 108.9MB in the beginning and 123.7MB in the end (delta: -14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16068.67ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 122.7MB in the beginning and 215.9MB in the end (delta: -93.3MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. * Witness Printer took 203.84ms. Allocated memory is still 287.3MB. Free memory was 215.9MB in the beginning and 185.0MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4759, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 830, dependent conditional: 824, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3941, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3941, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4049, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 120, dependent conditional: 114, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4049, independent: 3929, independent conditional: 102, independent unconditional: 3827, dependent: 120, dependent conditional: 6, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4049, independent: 3929, independent conditional: 102, independent unconditional: 3827, dependent: 120, dependent conditional: 6, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 442, independent: 431, independent conditional: 68, independent unconditional: 363, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 442, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 68, independent unconditional: 1, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 68, independent unconditional: 1, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3214, independent: 2530, independent conditional: 2367, independent unconditional: 164, dependent: 684, dependent conditional: 237, dependent unconditional: 447, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4049, independent: 3498, independent conditional: 34, independent unconditional: 3464, dependent: 109, dependent conditional: 1, dependent unconditional: 108, unknown: 442, unknown conditional: 73, unknown unconditional: 369] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 431, Positive conditional cache size: 68, Positive unconditional cache size: 363, Negative cache size: 11, Negative conditional cache size: 5, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3544, Maximal queried relation: 1, Independence queries for same thread: 818, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 32, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 397, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4759, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 830, dependent conditional: 824, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3941, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3941, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4049, independent: 3929, independent conditional: 3538, independent unconditional: 391, dependent: 120, dependent conditional: 114, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4049, independent: 3929, independent conditional: 102, independent unconditional: 3827, dependent: 120, dependent conditional: 6, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4049, independent: 3929, independent conditional: 102, independent unconditional: 3827, dependent: 120, dependent conditional: 6, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 442, independent: 431, independent conditional: 68, independent unconditional: 363, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 442, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 68, independent unconditional: 1, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 69, independent conditional: 68, independent unconditional: 1, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3214, independent: 2530, independent conditional: 2367, independent unconditional: 164, dependent: 684, dependent conditional: 237, dependent unconditional: 447, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4049, independent: 3498, independent conditional: 34, independent unconditional: 3464, dependent: 109, dependent conditional: 1, dependent unconditional: 108, unknown: 442, unknown conditional: 73, unknown unconditional: 369] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 431, Positive conditional cache size: 68, Positive unconditional cache size: 363, Negative cache size: 11, Negative conditional cache size: 5, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3544, Maximal queried relation: 1, Independence queries for same thread: 818 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=3, id1=-2, id2=-1, j=6, k=0, k=0] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND FALSE 1 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND FALSE 2 !(k < 20) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=20] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=20, k=20] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=20, k=20] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=20, k=20] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 42 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 7.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 3811 SizeOfPredicates, 42 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 0/1584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 12:05:19,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ec8ff60-6dd3-41ac-ba6b-51ba5a12f870/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE