./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-local/triangular-longer-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 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-longer-2.i ./goblint.2024-09-02_08-21-23.files/protection-local/triangular-longer-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-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 18:20:14,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 18:20:14,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 18:20:14,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 18:20:14,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 18:20:14,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 18:20:14,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 18:20:14,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 18:20:14,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 18:20:14,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 18:20:14,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 18:20:14,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 18:20:14,974 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 18:20:14,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 18:20:14,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 18:20:14,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 18:20:14,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 18:20:14,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 18:20:14,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 18:20:14,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 18:20:14,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 18:20:14,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 18:20:14,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 18:20:14,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 18:20:14,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 18:20:14,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 18:20:14,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 18:20:14,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 18:20:14,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 18:20:14,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 18:20:14,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 18:20:14,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 18:20:14,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 18:20:14,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 18:20:14,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 18:20:14,989 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 18:20:14,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 18:20:14,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 18:20:14,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 18:20:14,993 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 18:20:14,993 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 18:20:14,993 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-08 18:20:15,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 18:20:15,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 18:20:15,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 18:20:15,315 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 18:20:15,316 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 18:20:15,318 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-local/triangular-longer-2.yml/witness.yml [2024-09-08 18:20:15,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 18:20:15,397 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 18:20:15,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-09-08 18:20:17,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 18:20:17,291 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 18:20:17,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-09-08 18:20:17,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/af37797b1/e773aa52aeeb4ec8a6b358b774937292/FLAG296d7bc37 [2024-09-08 18:20:17,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/af37797b1/e773aa52aeeb4ec8a6b358b774937292 [2024-09-08 18:20:17,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 18:20:17,322 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 18:20:17,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 18:20:17,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 18:20:17,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 18:20:17,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:20:15" (1/2) ... [2024-09-08 18:20:17,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69267d6c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:20:17, skipping insertion in model container [2024-09-08 18:20:17,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:20:15" (1/2) ... [2024-09-08 18:20:17,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10169c29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:20:17, skipping insertion in model container [2024-09-08 18:20:17,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:20:17" (2/2) ... [2024-09-08 18:20:17,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69267d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17, skipping insertion in model container [2024-09-08 18:20:17,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:20:17" (2/2) ... [2024-09-08 18:20:17,365 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 18:20:17,366 INFO L1541 ArrayList]: Location invariant before [L698-L698] (((3 <= i) && (4 <= j)) && (i % 2 == 1)) && (j % 2 == 0) [2024-09-08 18:20:17,367 INFO L1541 ArrayList]: Location invariant before [L706-L706] (((3 <= i) && (4 <= j)) && (i % 2 == 1)) && (j % 2 == 0) [2024-09-08 18:20:17,367 INFO L1541 ArrayList]: Location invariant before [L719-L719] (((3 <= i) && (4 <= j)) && (i % 2 == 1)) && (j % 2 == 0) [2024-09-08 18:20:17,367 INFO L1541 ArrayList]: Location invariant before [L716-L716] (((3 <= i) && (4 <= j)) && (i % 2 == 1)) && (j % 2 == 0) [2024-09-08 18:20:17,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 18:20:17,797 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-09-08 18:20:17,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 18:20:17,819 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 18:20:17,925 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-09-08 18:20:17,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 18:20:17,963 INFO L204 MainTranslator]: Completed translation [2024-09-08 18:20:17,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17 WrapperNode [2024-09-08 18:20:17,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 18:20:17,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 18:20:17,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 18:20:17,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 18:20:17,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:17,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,007 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2024-09-08 18:20:18,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 18:20:18,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 18:20:18,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 18:20:18,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 18:20:18,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 18:20:18,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 18:20:18,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 18:20:18,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 18:20:18,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (1/1) ... [2024-09-08 18:20:18,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 18:20:18,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:20:18,081 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-08 18:20:18,084 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-08 18:20:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-09-08 18:20:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-09-08 18:20:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-09-08 18:20:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-09-08 18:20:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 18:20:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 18:20:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 18:20:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 18:20:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 18:20:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 18:20:18,139 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 18:20:18,265 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 18:20:18,270 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 18:20:18,450 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 18:20:18,451 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 18:20:18,616 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 18:20:18,616 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-08 18:20:18,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:20:18 BoogieIcfgContainer [2024-09-08 18:20:18,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 18:20:18,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 18:20:18,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 18:20:18,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 18:20:18,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:20:15" (1/4) ... [2024-09-08 18:20:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35352d9e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 06:20:18, skipping insertion in model container [2024-09-08 18:20:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:20:17" (2/4) ... [2024-09-08 18:20:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35352d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:20:18, skipping insertion in model container [2024-09-08 18:20:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:20:17" (3/4) ... [2024-09-08 18:20:18,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35352d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:20:18, skipping insertion in model container [2024-09-08 18:20:18,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:20:18" (4/4) ... [2024-09-08 18:20:18,626 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-09-08 18:20:18,642 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 18:20:18,642 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-08 18:20:18,642 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 18:20:18,690 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 18:20:18,727 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 18:20:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 18:20:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:20:18,730 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-08 18:20:18,732 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-08 18:20:18,779 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 18:20:18,791 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-09-08 18:20:18,797 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;@4ad1eb79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 18:20:18,797 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 18:20:18,911 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 18:20:18,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash -514768752, now seen corresponding path program 1 times [2024-09-08 18:20:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:18,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503738439] [2024-09-08 18:20:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:20,117 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-08 18:20:20,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503738439] [2024-09-08 18:20:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503738439] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:20:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:20:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 18:20:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553770059] [2024-09-08 18:20:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:20,126 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 18:20:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:20,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 18:20:20,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 18:20:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:20,157 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:20,159 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-08 18:20:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:20,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 18:20:20,271 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 18:20:20,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1073446233, now seen corresponding path program 1 times [2024-09-08 18:20:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:20,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706709795] [2024-09-08 18:20:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 18:20:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706709795] [2024-09-08 18:20:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706709795] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:20:20,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:20:20,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 18:20:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3130868] [2024-09-08 18:20:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:20,522 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 18:20:20,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 18:20:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 18:20:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:20,526 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:20,526 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:20:20,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:20,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:20,608 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 18:20:20,608 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 18:20:20,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash -452860818, now seen corresponding path program 1 times [2024-09-08 18:20:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:20,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287671761] [2024-09-08 18:20:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:20,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 18:20:20,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:20,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287671761] [2024-09-08 18:20:20,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287671761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:20:20,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:20:20,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 18:20:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190936438] [2024-09-08 18:20:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:20,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 18:20:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 18:20:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 18:20:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:20,882 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:20,882 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:20:20,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:20,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:20,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:20,977 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 18:20:20,978 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 18:20:20,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1366578936, now seen corresponding path program 1 times [2024-09-08 18:20:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028490964] [2024-09-08 18:20:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 18:20:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:21,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028490964] [2024-09-08 18:20:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028490964] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 18:20:21,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905801491] [2024-09-08 18:20:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:21,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 18:20:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:20:21,463 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-08 18:20:21,466 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-08 18:20:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:21,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-08 18:20:21,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 18:20:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 18:20:21,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 18:20:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 18:20:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905801491] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-08 18:20:21,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-08 18:20:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 9 [2024-09-08 18:20:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524257987] [2024-09-08 18:20:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:21,728 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 18:20:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 18:20:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-08 18:20:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:21,729 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:21,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 18:20:21,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:21,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:21,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:21,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:22,135 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-08 18:20:22,155 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-08 18:20:22,336 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-08 18:20:22,344 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 18:20:22,345 INFO L312 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-09-08 18:20:22,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 18:20:22,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 18:20:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:20:22,351 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 18:20:22,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-09-08 18:20:22,355 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 18:20:22,355 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 18:20:22,356 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;@4ad1eb79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 18:20:22,356 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-08 18:20:22,411 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-08 18:20:22,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1720132814, now seen corresponding path program 1 times [2024-09-08 18:20:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145821503] [2024-09-08 18:20:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:22,578 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-08 18:20:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145821503] [2024-09-08 18:20:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145821503] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:20:22,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:20:22,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 18:20:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622038880] [2024-09-08 18:20:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:22,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 18:20:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:22,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 18:20:22,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 18:20:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:22,581 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:22,581 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-08 18:20:22,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:22,619 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 18:20:22,620 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-08 18:20:22,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1222052216, now seen corresponding path program 1 times [2024-09-08 18:20:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108794863] [2024-09-08 18:20:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:22,742 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-08 18:20:22,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108794863] [2024-09-08 18:20:22,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108794863] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:20:22,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:20:22,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 18:20:22,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707643017] [2024-09-08 18:20:22,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:22,744 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 18:20:22,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:22,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 18:20:22,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-08 18:20:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:22,745 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:22,745 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:20:22,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:22,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:22,874 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 18:20:22,875 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-08 18:20:22,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -583753326, now seen corresponding path program 1 times [2024-09-08 18:20:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807062681] [2024-09-08 18:20:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:23,089 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-08 18:20:23,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:23,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807062681] [2024-09-08 18:20:23,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807062681] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 18:20:23,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 18:20:23,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 18:20:23,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64334574] [2024-09-08 18:20:23,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 18:20:23,091 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 18:20:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:23,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 18:20:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-08 18:20:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:23,093 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:23,094 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 18:20:23,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:23,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:23,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:20:23,265 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 18:20:23,265 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-08 18:20:23,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 174210604, now seen corresponding path program 2 times [2024-09-08 18:20:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715636682] [2024-09-08 18:20:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:23,506 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-08 18:20:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715636682] [2024-09-08 18:20:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715636682] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 18:20:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550704298] [2024-09-08 18:20:23,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 18:20:23,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 18:20:23,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:20:23,509 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-08 18:20:23,511 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-08 18:20:23,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 18:20:23,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 18:20:23,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-08 18:20:23,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 18:20:23,700 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-08 18:20:23,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 18:20:23,896 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-08 18:20:23,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550704298] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 18:20:23,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 18:20:23,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-09-08 18:20:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402717678] [2024-09-08 18:20:23,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 18:20:23,898 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-08 18:20:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-08 18:20:23,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-09-08 18:20:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:23,899 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:23,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 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-08 18:20:23,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:23,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:23,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:20:23,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:20:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 18:20:24,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-08 18:20:24,469 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 18:20:24,470 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-08 18:20:24,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -857903366, now seen corresponding path program 3 times [2024-09-08 18:20:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118737882] [2024-09-08 18:20:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 18:20:24,878 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-08 18:20:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 18:20:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118737882] [2024-09-08 18:20:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118737882] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 18:20:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694374257] [2024-09-08 18:20:24,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 18:20:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 18:20:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 18:20:24,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 18:20:24,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-08 18:20:24,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-08 18:20:24,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 18:20:24,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-08 18:20:24,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 18:20:25,153 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-08 18:20:25,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 18:20:25,481 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-08 18:20:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694374257] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 18:20:25,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 18:20:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2024-09-08 18:20:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462668540] [2024-09-08 18:20:25,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 18:20:25,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-08 18:20:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 18:20:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-08 18:20:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2024-09-08 18:20:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:25,484 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 18:20:25,485 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 28 states have internal predecessors, (91), 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-08 18:20:25,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:25,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:25,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:20:25,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 18:20:25,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 18:20:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 18:20:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 18:20:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 18:20:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 18:20:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 18:20:26,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-08 18:20:26,359 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-08 18:20:26,360 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-08 18:20:26,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 18:20:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2006631676, now seen corresponding path program 4 times [2024-09-08 18:20:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 18:20:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506233891] [2024-09-08 18:20:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 18:20:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 18:20:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 18:20:26,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 18:20:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 18:20:26,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 18:20:26,487 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 18:20:26,487 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-08 18:20:26,488 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-08 18:20:26,488 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-08 18:20:26,488 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-09-08 18:20:26,489 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-09-08 18:20:26,489 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 18:20:26,491 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2024-09-08 18:20:26,493 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-08 18:20:26,607 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 18:20:26,607 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 18:20:26,613 INFO L469 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-09-08 18:20:26,613 INFO L470 ceAbstractionStarter]: WitnessConsidered=4 [2024-09-08 18:20:26,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:20:26 BasicIcfg [2024-09-08 18:20:26,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 18:20:26,615 INFO L158 Benchmark]: Toolchain (without parser) took 9292.82ms. Allocated memory was 151.0MB in the beginning and 302.0MB in the end (delta: 151.0MB). Free memory was 92.7MB in the beginning and 239.3MB in the end (delta: -146.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-09-08 18:20:26,615 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 116.1MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 18:20:26,615 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 18:20:26,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.36ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 67.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-09-08 18:20:26,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.94ms. Allocated memory is still 151.0MB. Free memory was 67.4MB in the beginning and 65.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 18:20:26,616 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 151.0MB. Free memory was 65.4MB in the beginning and 63.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 18:20:26,616 INFO L158 Benchmark]: RCFGBuilder took 578.25ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 63.9MB in the beginning and 172.2MB in the end (delta: -108.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-09-08 18:20:26,617 INFO L158 Benchmark]: TraceAbstraction took 7994.96ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 172.2MB in the beginning and 239.3MB in the end (delta: -67.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-09-08 18:20:26,618 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.19ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 116.1MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.36ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 67.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.94ms. Allocated memory is still 151.0MB. Free memory was 67.4MB in the beginning and 65.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.08ms. Allocated memory is still 151.0MB. Free memory was 65.4MB in the beginning and 63.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.25ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 63.9MB in the beginning and 172.2MB in the end (delta: -108.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7994.96ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 172.2MB in the beginning and 239.3MB in the end (delta: -67.1MB). Peak memory consumption was 26.2MB. 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: 3073, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 497, dependent conditional: 490, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2651, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 75, dependent conditional: 68, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2651, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 75, dependent conditional: 68, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2800, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 224, dependent conditional: 217, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2800, independent: 2576, independent conditional: 9, independent unconditional: 2567, dependent: 224, dependent conditional: 140, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2800, independent: 2576, independent conditional: 9, independent unconditional: 2567, dependent: 224, dependent conditional: 140, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 378, independent: 349, independent conditional: 3, independent unconditional: 346, dependent: 29, dependent conditional: 22, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 378, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 3, independent unconditional: 17, dependent: 29, dependent conditional: 22, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 3, independent unconditional: 17, dependent: 29, dependent conditional: 22, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 257, independent: 120, independent conditional: 23, independent unconditional: 98, dependent: 136, dependent conditional: 109, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2800, independent: 2227, independent conditional: 6, independent unconditional: 2221, dependent: 195, dependent conditional: 118, dependent unconditional: 77, unknown: 378, unknown conditional: 25, unknown unconditional: 353] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 349, Positive conditional cache size: 3, Positive unconditional cache size: 346, Negative cache size: 29, Negative conditional cache size: 22, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2217, Maximal queried relation: 4, Independence queries for same thread: 422, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 195, Number of trivial persistent sets: 167, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 434, independent: 427, independent conditional: 0, independent unconditional: 427, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3073, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 497, dependent conditional: 490, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2651, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 75, dependent conditional: 68, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2651, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 75, dependent conditional: 68, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2800, independent: 2576, independent conditional: 2149, independent unconditional: 427, dependent: 224, dependent conditional: 217, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2800, independent: 2576, independent conditional: 9, independent unconditional: 2567, dependent: 224, dependent conditional: 140, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2800, independent: 2576, independent conditional: 9, independent unconditional: 2567, dependent: 224, dependent conditional: 140, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 378, independent: 349, independent conditional: 3, independent unconditional: 346, dependent: 29, dependent conditional: 22, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 378, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 3, independent unconditional: 17, dependent: 29, dependent conditional: 22, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 3, independent unconditional: 17, dependent: 29, dependent conditional: 22, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 257, independent: 120, independent conditional: 23, independent unconditional: 98, dependent: 136, dependent conditional: 109, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2800, independent: 2227, independent conditional: 6, independent unconditional: 2221, dependent: 195, dependent conditional: 118, dependent unconditional: 77, unknown: 378, unknown conditional: 25, unknown unconditional: 353] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 349, Positive conditional cache size: 3, Positive unconditional cache size: 346, Negative cache size: 29, Negative conditional cache size: 22, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2217, Maximal queried relation: 4, Independence queries for same thread: 422 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2344, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 335, dependent conditional: 329, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2019, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2019, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2051, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 42, dependent conditional: 36, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2051, independent: 2009, independent conditional: 28, independent unconditional: 1981, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2051, independent: 2009, independent conditional: 28, independent unconditional: 1981, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 319, independent: 309, independent conditional: 28, independent unconditional: 281, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 319, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 42, independent conditional: 28, independent unconditional: 14, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 42, independent conditional: 28, independent unconditional: 14, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, independent: 176, independent conditional: 108, independent unconditional: 69, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2051, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 319, unknown conditional: 32, unknown unconditional: 287] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 309, Positive conditional cache size: 28, Positive unconditional cache size: 281, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1714, Maximal queried relation: 1, Independence queries for same thread: 325, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 22, Number of trivial persistent sets: 12, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2344, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 335, dependent conditional: 329, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2019, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2019, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2051, independent: 2009, independent conditional: 1710, independent unconditional: 299, dependent: 42, dependent conditional: 36, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2051, independent: 2009, independent conditional: 28, independent unconditional: 1981, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2051, independent: 2009, independent conditional: 28, independent unconditional: 1981, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 319, independent: 309, independent conditional: 28, independent unconditional: 281, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 319, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 42, independent conditional: 28, independent unconditional: 14, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 42, independent conditional: 28, independent unconditional: 14, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, independent: 176, independent conditional: 108, independent unconditional: 69, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2051, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 319, unknown conditional: 32, unknown unconditional: 287] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 309, Positive conditional cache size: 28, Positive unconditional cache size: 281, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1714, Maximal queried relation: 1, Independence queries for same thread: 325 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-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] [L716] 0 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [L716] 0 int condI = i >= (2*10 +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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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 < 10 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 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [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] [L719] 0 //@ assert ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)); [L719] 0 int condJ = j >= (2*10 +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=25, id1=-1, id2=0, j=26, k=10, k=10] [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=25, id1=-1, id2=0, j=26, k=10, k=10] [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=25, id1=-1, id2=0, j=26, k=10, k=10] - UnprovableResult [Line: 716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 40 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, 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: 16, 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.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 2 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 21/31 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 40 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.4s, 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: 54, 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, 1.9s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1590 SizeOfPredicates, 18 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 0/198 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-08 18:20:26,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-09-08 18:20:26,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-09-08 18:20:27,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE