./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-ghost/triangular-longest-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i ./goblint.2024-09-02_08-21-23.files/protection-ghost/triangular-longest-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-23 08:15:33,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-23 08:15:33,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-23 08:15:33,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-23 08:15:33,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-23 08:15:33,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-23 08:15:33,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-23 08:15:33,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-23 08:15:33,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-23 08:15:33,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-23 08:15:33,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-23 08:15:33,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-23 08:15:33,689 INFO L153 SettingsManager]: * Use SBE=true [2024-09-23 08:15:33,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-23 08:15:33,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-23 08:15:33,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-23 08:15:33,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-23 08:15:33,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-23 08:15:33,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-23 08:15:33,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-23 08:15:33,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-23 08:15:33,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-23 08:15:33,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-23 08:15:33,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-23 08:15:33,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-23 08:15:33,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-23 08:15:33,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-23 08:15:33,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-23 08:15:33,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-23 08:15:33,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-23 08:15:33,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 08:15:33,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-23 08:15:33,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-23 08:15:33,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-23 08:15:33,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-23 08:15:33,704 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-23 08:15:33,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-23 08:15:33,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-23 08:15:33,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-23 08:15:33,705 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-23 08:15:33,706 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-23 08:15:33,706 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:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-23 08:15:33,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-23 08:15:34,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-23 08:15:34,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-23 08:15:34,012 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-23 08:15:34,013 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-23 08:15:34,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-ghost/triangular-longest-2.yml/witness.yml [2024-09-23 08:15:34,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-23 08:15:34,083 INFO L274 PluginConnector]: CDTParser initialized [2024-09-23 08:15:34,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-09-23 08:15:35,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-23 08:15:35,870 INFO L384 CDTParser]: Found 1 translation units. [2024-09-23 08:15:35,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-09-23 08:15:35,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4fae2a9f1/984b8d2892f545bc81eaa94f54c33264/FLAG37dceb594 [2024-09-23 08:15:35,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4fae2a9f1/984b8d2892f545bc81eaa94f54c33264 [2024-09-23 08:15:35,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-23 08:15:35,909 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-23 08:15:35,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-23 08:15:35,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-23 08:15:35,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-23 08:15:35,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 08:15:34" (1/2) ... [2024-09-23 08:15:35,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5728d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 08:15:35, skipping insertion in model container [2024-09-23 08:15:35,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 08:15:34" (1/2) ... [2024-09-23 08:15:35,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@378bdb21 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 08:15:35, skipping insertion in model container [2024-09-23 08:15:35,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 08:15:35" (2/2) ... [2024-09-23 08:15:35,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5728d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:35, skipping insertion in model container [2024-09-23 08:15:35,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 08:15:35" (2/2) ... [2024-09-23 08:15:35,943 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-23 08:15:35,944 INFO L1541 ArrayList]: Location invariant before [L715-L715] (! multithreaded || (3 <= i && i % 2 == 1)) && (! multithreaded || (4 <= j && j % 2 == 0)) [2024-09-23 08:15:35,944 INFO L1541 ArrayList]: Location invariant before [L714-L714] (! multithreaded || (3 <= i && i % 2 == 1)) && (! multithreaded || (4 <= j && j % 2 == 0)) [2024-09-23 08:15:35,944 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-09-23 08:15:35,944 INFO L1541 ArrayList]: ghost_update [L713-L713] multithreaded = 1; [2024-09-23 08:15:35,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-23 08:15:36,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-09-23 08:15:36,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 08:15:36,324 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-23 08:15:36,393 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-09-23 08:15:36,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 08:15:36,425 INFO L204 MainTranslator]: Completed translation [2024-09-23 08:15:36,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36 WrapperNode [2024-09-23 08:15:36,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-23 08:15:36,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-23 08:15:36,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-23 08:15:36,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-23 08:15:36,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,464 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-09-23 08:15:36,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-23 08:15:36,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-23 08:15:36,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-23 08:15:36,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-23 08:15:36,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-23 08:15:36,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-23 08:15:36,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-23 08:15:36,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-23 08:15:36,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (1/1) ... [2024-09-23 08:15:36,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 08:15:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 08:15:36,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-23 08:15:36,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-23 08:15:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-09-23 08:15:36,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-09-23 08:15:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-09-23 08:15:36,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-09-23 08:15:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-23 08:15:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-23 08:15:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-23 08:15:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-23 08:15:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-23 08:15:36,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-23 08:15:36,571 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-23 08:15:36,684 INFO L242 CfgBuilder]: Building ICFG [2024-09-23 08:15:36,686 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-23 08:15:36,841 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-23 08:15:36,842 INFO L291 CfgBuilder]: Performing block encoding [2024-09-23 08:15:36,971 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-23 08:15:36,971 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-23 08:15:36,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 08:15:36 BoogieIcfgContainer [2024-09-23 08:15:36,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-23 08:15:36,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-23 08:15:36,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-23 08:15:36,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-23 08:15:36,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 08:15:34" (1/4) ... [2024-09-23 08:15:36,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3740b2a2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.09 08:15:36, skipping insertion in model container [2024-09-23 08:15:36,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.09 08:15:35" (2/4) ... [2024-09-23 08:15:36,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3740b2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 08:15:36, skipping insertion in model container [2024-09-23 08:15:36,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 08:15:36" (3/4) ... [2024-09-23 08:15:36,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3740b2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 08:15:36, skipping insertion in model container [2024-09-23 08:15:36,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 08:15:36" (4/4) ... [2024-09-23 08:15:36,992 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-09-23 08:15:37,010 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-23 08:15:37,011 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-23 08:15:37,011 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-23 08:15:37,053 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-23 08:15:37,105 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 08:15:37,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 08:15:37,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 08:15:37,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-23 08:15:37,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-23 08:15:37,151 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 08:15:37,167 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-23 08:15:37,173 INFO L336 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=None, 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;@36151668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 08:15:37,176 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-23 08:15:37,280 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:37,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1388308107, now seen corresponding path program 1 times [2024-09-23 08:15:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101203008] [2024-09-23 08:15:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 08:15:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 08:15:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101203008] [2024-09-23 08:15:37,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101203008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 08:15:37,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 08:15:37,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-23 08:15:37,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663101870] [2024-09-23 08:15:37,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 08:15:37,990 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 08:15:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 08:15:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 08:15:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 08:15:38,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:38,016 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 08:15:38,017 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-09-23 08:15:38,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:38,100 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-23 08:15:38,101 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:38,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1248443706, now seen corresponding path program 1 times [2024-09-23 08:15:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978472479] [2024-09-23 08:15:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 08:15:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:38,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 08:15:38,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978472479] [2024-09-23 08:15:38,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978472479] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 08:15:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 08:15:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 08:15:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621802471] [2024-09-23 08:15:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 08:15:38,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 08:15:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 08:15:38,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 08:15:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-23 08:15:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:38,296 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 08:15:38,297 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-09-23 08:15:38,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:38,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:38,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-23 08:15:38,458 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:38,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1765444373, now seen corresponding path program 1 times [2024-09-23 08:15:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181519440] [2024-09-23 08:15:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 08:15:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 08:15:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181519440] [2024-09-23 08:15:38,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181519440] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 08:15:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 08:15:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-23 08:15:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562475249] [2024-09-23 08:15:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 08:15:38,712 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 08:15:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 08:15:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 08:15:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-23 08:15:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:38,717 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 08:15:38,717 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-09-23 08:15:38,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:38,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:38,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:38,902 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-23 08:15:38,902 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:38,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -898479952, now seen corresponding path program 2 times [2024-09-23 08:15:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938480240] [2024-09-23 08:15:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 08:15:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:39,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 08:15:39,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938480240] [2024-09-23 08:15:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938480240] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 08:15:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117114705] [2024-09-23 08:15:39,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-23 08:15:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 08:15:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 08:15:39,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 08:15:39,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-23 08:15:39,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-23 08:15:39,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 08:15:39,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-23 08:15:39,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 08:15:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:39,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 08:15:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117114705] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 08:15:39,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 08:15:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-09-23 08:15:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381116923] [2024-09-23 08:15:39,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 08:15:39,650 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-23 08:15:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 08:15:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-23 08:15:39,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-23 08:15:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:39,651 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 08:15:39,652 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 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-09-23 08:15:39,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:39,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:39,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:39,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-23 08:15:40,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-23 08:15:40,208 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 08:15:40,209 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:40,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash 87228417, now seen corresponding path program 3 times [2024-09-23 08:15:40,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346853041] [2024-09-23 08:15:40,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 08:15:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:40,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 08:15:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346853041] [2024-09-23 08:15:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346853041] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 08:15:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359813471] [2024-09-23 08:15:40,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-23 08:15:40,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 08:15:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 08:15:40,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 08:15:40,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-23 08:15:40,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-23 08:15:40,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 08:15:40,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-23 08:15:40,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 08:15:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:40,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 08:15:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359813471] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 08:15:41,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 08:15:41,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-09-23 08:15:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634053390] [2024-09-23 08:15:41,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 08:15:41,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-23 08:15:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 08:15:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-23 08:15:41,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2024-09-23 08:15:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:41,257 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 08:15:41,257 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 08:15:41,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:41,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:41,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:41,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-23 08:15:41,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-23 08:15:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-23 08:15:41,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-23 08:15:42,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 08:15:42,103 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:42,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash -104331293, now seen corresponding path program 4 times [2024-09-23 08:15:42,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:42,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324851512] [2024-09-23 08:15:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 08:15:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:42,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 08:15:42,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324851512] [2024-09-23 08:15:42,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324851512] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-23 08:15:42,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978209020] [2024-09-23 08:15:42,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-23 08:15:42,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 08:15:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 08:15:42,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-23 08:15:42,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-23 08:15:42,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-23 08:15:42,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-23 08:15:42,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-23 08:15:42,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-23 08:15:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:43,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-23 08:15:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 08:15:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978209020] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-23 08:15:44,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-23 08:15:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2024-09-23 08:15:44,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226559086] [2024-09-23 08:15:44,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-23 08:15:44,047 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-23 08:15:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 08:15:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-23 08:15:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=2041, Unknown=0, NotChecked=0, Total=2652 [2024-09-23 08:15:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:44,050 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 08:15:44,050 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.326923076923077) internal successors, (173), 51 states have internal predecessors, (173), 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-09-23 08:15:44,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:44,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:44,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:44,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-23 08:15:44,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-23 08:15:44,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 08:15:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 08:15:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 08:15:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 08:15:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-23 08:15:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-23 08:15:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-23 08:15:45,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-23 08:15:45,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-23 08:15:45,602 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-23 08:15:45,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 08:15:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1590002390, now seen corresponding path program 5 times [2024-09-23 08:15:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 08:15:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478679890] [2024-09-23 08:15:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 08:15:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 08:15:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 08:15:45,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-23 08:15:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 08:15:45,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-23 08:15:45,706 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-23 08:15:45,707 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-23 08:15:45,709 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-23 08:15:45,710 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-23 08:15:45,710 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-09-23 08:15:45,710 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-09-23 08:15:45,710 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-23 08:15:45,721 INFO L408 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-09-23 08:15:45,882 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-23 08:15:45,883 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-23 08:15:45,885 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-23 08:15:45,885 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-23 08:15:45,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 08:15:45 BasicIcfg [2024-09-23 08:15:45,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-23 08:15:45,886 INFO L158 Benchmark]: Toolchain (without parser) took 9977.68ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 108.2MB in the beginning and 183.5MB in the end (delta: -75.2MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-09-23 08:15:45,887 INFO L158 Benchmark]: Witness Parser took 0.40ms. Allocated memory is still 167.8MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-23 08:15:45,887 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-23 08:15:45,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.39ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 84.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-23 08:15:45,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.07ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 82.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-23 08:15:45,888 INFO L158 Benchmark]: Boogie Preprocessor took 26.19ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-23 08:15:45,888 INFO L158 Benchmark]: RCFGBuilder took 478.84ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 81.0MB in the beginning and 188.4MB in the end (delta: -107.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-09-23 08:15:45,889 INFO L158 Benchmark]: TraceAbstraction took 8908.15ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 187.4MB in the beginning and 183.5MB in the end (delta: 3.9MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-09-23 08:15:45,890 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.40ms. Allocated memory is still 167.8MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.39ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 84.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.07ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 82.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.19ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.84ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 81.0MB in the beginning and 188.4MB in the end (delta: -107.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8908.15ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 187.4MB in the beginning and 183.5MB in the end (delta: 3.9MB). Peak memory consumption was 51.1MB. 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: 2580, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 454, dependent conditional: 444, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2141, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2141, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2180, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 54, dependent conditional: 44, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2180, independent: 2126, independent conditional: 34, independent unconditional: 2092, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2180, independent: 2126, independent conditional: 34, independent unconditional: 2092, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 304, independent: 289, independent conditional: 34, independent unconditional: 255, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 304, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 39, independent conditional: 34, independent unconditional: 5, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 39, independent conditional: 34, independent unconditional: 5, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 119, independent conditional: 65, independent unconditional: 54, dependent: 43, dependent conditional: 13, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2180, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 304, unknown conditional: 39, unknown unconditional: 265] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 289, Positive conditional cache size: 34, Positive unconditional cache size: 255, Negative cache size: 15, Negative conditional cache size: 5, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1866, Maximal queried relation: 1, Independence queries for same thread: 439, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 20, Number of trivial persistent sets: 10, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, independent: 265, independent conditional: 0, independent unconditional: 265, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2580, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 454, dependent conditional: 444, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2141, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2141, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2180, independent: 2126, independent conditional: 1861, independent unconditional: 265, dependent: 54, dependent conditional: 44, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2180, independent: 2126, independent conditional: 34, independent unconditional: 2092, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2180, independent: 2126, independent conditional: 34, independent unconditional: 2092, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 304, independent: 289, independent conditional: 34, independent unconditional: 255, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 304, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 39, independent conditional: 34, independent unconditional: 5, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 39, independent conditional: 34, independent unconditional: 5, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 119, independent conditional: 65, independent unconditional: 54, dependent: 43, dependent conditional: 13, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2180, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 304, unknown conditional: 39, unknown unconditional: 265] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 289, Positive conditional cache size: 34, Positive unconditional cache size: 255, Negative cache size: 15, Negative conditional cache size: 5, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1866, Maximal queried relation: 1, Independence queries for same thread: 439 - 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; [L1] 0 //@ ghost int multithreaded = 0; [L712] 0 pthread_t id1, id2; [L713] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [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=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] 0 //@ assert ((!multithreaded || ((3 <= i) && ((i % 2) == 1))) && (!multithreaded || ((4 <= j) && ((j % 2) == 0)))); VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-1, 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=-1, id2=0, 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] [L715] 0 //@ assert ((!multithreaded || ((3 <= i) && ((i % 2) == 1))) && (!multithreaded || ((4 <= j) && ((j % 2) == 0)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=3, id1=-1, id2=0, 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=-1, id2=0, 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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=-1, id2=0, 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=-1, id2=0, 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=-1, id2=0, j=46, k=20, k=20] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 2.9s, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 3417 SizeOfPredicates, 42 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 0/1188 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-09-23 08:15:45,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-23 08:15:46,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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