./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/mutex-meet-local/triangular-longest-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7bc0c755 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i ./goblint.2024-08-08_07-59-58.files/mutex-meet-local/triangular-longest-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-validation-atomicfix-7bc0c75-m [2024-08-23 04:30:57,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-23 04:30:57,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-23 04:30:57,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-23 04:30:57,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-23 04:30:57,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-23 04:30:57,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-23 04:30:57,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-23 04:30:57,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-23 04:30:57,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-23 04:30:57,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-23 04:30:57,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-23 04:30:57,963 INFO L153 SettingsManager]: * Use SBE=true [2024-08-23 04:30:57,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-23 04:30:57,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-23 04:30:57,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-23 04:30:57,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-23 04:30:57,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-23 04:30:57,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-23 04:30:57,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-23 04:30:57,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-23 04:30:57,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-23 04:30:57,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-23 04:30:57,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-23 04:30:57,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-23 04:30:57,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-23 04:30:57,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-23 04:30:57,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-23 04:30:57,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-23 04:30:57,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-23 04:30:57,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-23 04:30:57,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-23 04:30:57,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-23 04:30:57,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-23 04:30:57,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-23 04:30:57,980 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-23 04:30:57,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-23 04:30:57,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-23 04:30:57,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-23 04:30:57,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-23 04:30:57,981 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-23 04:30:57,982 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-23 04:30:57,982 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-23 04:30:58,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-23 04:30:58,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-23 04:30:58,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-23 04:30:58,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-23 04:30:58,195 INFO L274 PluginConnector]: CDTParser initialized [2024-08-23 04:30:58,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-08-23 04:30:59,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-23 04:30:59,787 INFO L384 CDTParser]: Found 1 translation units. [2024-08-23 04:30:59,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-08-23 04:30:59,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c8a0b8555/bba82db30013439ea2e1d0584786536a/FLAGb3ac7ff1c [2024-08-23 04:30:59,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c8a0b8555/bba82db30013439ea2e1d0584786536a [2024-08-23 04:30:59,821 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-23 04:30:59,821 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-23 04:30:59,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/mutex-meet-local/triangular-longest-2.yml/witness.yml [2024-08-23 04:30:59,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-23 04:30:59,933 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-23 04:30:59,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-23 04:30:59,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-23 04:30:59,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-23 04:30:59,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 04:30:59" (1/2) ... [2024-08-23 04:30:59,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2169fae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:30:59, skipping insertion in model container [2024-08-23 04:30:59,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 04:30:59" (1/2) ... [2024-08-23 04:30:59,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@47e41dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:30:59, skipping insertion in model container [2024-08-23 04:30:59,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 04:30:59" (2/2) ... [2024-08-23 04:30:59,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2169fae4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:30:59, skipping insertion in model container [2024-08-23 04:30:59,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 04:30:59" (2/2) ... [2024-08-23 04:30:59,944 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-23 04:30:59,979 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-23 04:30:59,980 INFO L97 edCorrectnessWitness]: Location invariant before [L716-L716] ((((3 <= i) && (4 <= j)) && ((1LL - (long long )i) + (long long )j >= 0LL)) && (i % 2 == 1)) && (j % 2 == 0) [2024-08-23 04:30:59,981 INFO L97 edCorrectnessWitness]: Location invariant before [L719-L719] ((((3 <= i) && (4 <= j)) && ((1LL - (long long )i) + (long long )j >= 0LL)) && (i % 2 == 1)) && (j % 2 == 0) [2024-08-23 04:30:59,981 INFO L97 edCorrectnessWitness]: Location invariant before [L706-L706] ((((3 <= i) && (4 <= j)) && ((1LL - (long long )i) + (long long )j >= 0LL)) && (i % 2 == 1)) && (j % 2 == 0) [2024-08-23 04:30:59,981 INFO L97 edCorrectnessWitness]: Location invariant before [L698-L698] ((((3 <= i) && (4 <= j)) && ((1LL - (long long )i) + (long long )j >= 0LL)) && (i % 2 == 1)) && (j % 2 == 0) [2024-08-23 04:31:00,017 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-23 04:31:00,306 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-longest-2.i[30964,30977] [2024-08-23 04:31:00,309 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-23 04:31:00,315 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-23 04:31:00,448 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-longest-2.i[30964,30977] [2024-08-23 04:31:00,453 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-23 04:31:00,505 INFO L206 MainTranslator]: Completed translation [2024-08-23 04:31:00,505 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00 WrapperNode [2024-08-23 04:31:00,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-23 04:31:00,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-23 04:31:00,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-23 04:31:00,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-23 04:31:00,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,553 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-08-23 04:31:00,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-23 04:31:00,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-23 04:31:00,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-23 04:31:00,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-23 04:31:00,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-23 04:31:00,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-23 04:31:00,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-23 04:31:00,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-23 04:31:00,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (1/1) ... [2024-08-23 04:31:00,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-23 04:31:00,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:00,624 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-08-23 04:31:00,627 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-08-23 04:31:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-08-23 04:31:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-08-23 04:31:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-08-23 04:31:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-08-23 04:31:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-23 04:31:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-23 04:31:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-23 04:31:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-23 04:31:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-23 04:31:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-23 04:31:00,661 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-23 04:31:00,793 INFO L243 CfgBuilder]: Building ICFG [2024-08-23 04:31:00,795 INFO L269 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-23 04:31:00,976 INFO L288 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-23 04:31:00,976 INFO L292 CfgBuilder]: Performing block encoding [2024-08-23 04:31:01,072 INFO L314 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-23 04:31:01,072 INFO L319 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-23 04:31:01,073 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 04:31:01 BoogieIcfgContainer [2024-08-23 04:31:01,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-23 04:31:01,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-23 04:31:01,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-23 04:31:01,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-23 04:31:01,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 04:30:59" (1/4) ... [2024-08-23 04:31:01,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b0f1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 04:31:01, skipping insertion in model container [2024-08-23 04:31:01,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 04:30:59" (2/4) ... [2024-08-23 04:31:01,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b0f1b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.08 04:31:01, skipping insertion in model container [2024-08-23 04:31:01,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:31:00" (3/4) ... [2024-08-23 04:31:01,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b0f1b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.08 04:31:01, skipping insertion in model container [2024-08-23 04:31:01,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 04:31:01" (4/4) ... [2024-08-23 04:31:01,080 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-08-23 04:31:01,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-23 04:31:01,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-08-23 04:31:01,096 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-23 04:31:01,140 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-23 04:31:01,181 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 04:31:01,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 04:31:01,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:01,186 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-08-23 04:31:01,188 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-08-23 04:31:01,217 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 04:31:01,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-08-23 04:31:01,230 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2226a17c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 04:31:01,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-23 04:31:01,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-23 04:31:01,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1467237488, now seen corresponding path program 1 times [2024-08-23 04:31:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315180380] [2024-08-23 04:31:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315180380] [2024-08-23 04:31:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315180380] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 04:31:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 04:31:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-23 04:31:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948555068] [2024-08-23 04:31:02,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 04:31:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:02,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 04:31:02,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 04:31:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:02,060 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:02,062 INFO L496 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-08-23 04:31:02,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:02,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-23 04:31:02,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-23 04:31:02,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1707247193, now seen corresponding path program 1 times [2024-08-23 04:31:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:02,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381655119] [2024-08-23 04:31:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-23 04:31:02,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:02,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381655119] [2024-08-23 04:31:02,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381655119] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 04:31:02,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 04:31:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-23 04:31:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140754988] [2024-08-23 04:31:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:02,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-23 04:31:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:02,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-23 04:31:02,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-23 04:31:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:02,303 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:02,303 INFO L496 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-08-23 04:31:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:02,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-23 04:31:02,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-23 04:31:02,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1086661778, now seen corresponding path program 1 times [2024-08-23 04:31:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057020081] [2024-08-23 04:31:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057020081] [2024-08-23 04:31:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057020081] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 04:31:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 04:31:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-23 04:31:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856924905] [2024-08-23 04:31:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:02,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-23 04:31:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-23 04:31:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-23 04:31:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:02,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:02,563 INFO L496 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-08-23 04:31:02,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:02,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:02,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:02,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-23 04:31:02,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-23 04:31:02,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 332668168, now seen corresponding path program 1 times [2024-08-23 04:31:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64808858] [2024-08-23 04:31:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:03,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:03,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64808858] [2024-08-23 04:31:03,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64808858] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 04:31:03,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319574432] [2024-08-23 04:31:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:03,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 04:31:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:03,057 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-08-23 04:31:03,059 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-08-23 04:31:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:03,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-23 04:31:03,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 04:31:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:03,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 04:31:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-23 04:31:03,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319574432] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-23 04:31:03,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-23 04:31:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 9 [2024-08-23 04:31:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183929073] [2024-08-23 04:31:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:03,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 04:31:03,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 04:31:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-08-23 04:31:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:03,268 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:03,268 INFO L496 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-08-23 04:31:03,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:03,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:03,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:03,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 04:31:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:03,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-08-23 04:31:03,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-23 04:31:03,758 WARN L477 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-08-23 04:31:03,766 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-23 04:31:03,767 INFO L308 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-08-23 04:31:03,772 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 04:31:03,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 04:31:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:03,777 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-08-23 04:31:03,781 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-08-23 04:31:03,783 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 04:31:03,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-23 04:31:03,784 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2226a17c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 04:31:03,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-08-23 04:31:03,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:03,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1915789518, now seen corresponding path program 1 times [2024-08-23 04:31:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488618695] [2024-08-23 04:31:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488618695] [2024-08-23 04:31:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488618695] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 04:31:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 04:31:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-23 04:31:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131250973] [2024-08-23 04:31:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:04,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 04:31:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 04:31:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 04:31:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,029 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:04,029 INFO L496 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-08-23 04:31:04,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:04,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-23 04:31:04,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:04,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1760292464, now seen corresponding path program 1 times [2024-08-23 04:31:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928017956] [2024-08-23 04:31:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928017956] [2024-08-23 04:31:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928017956] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 04:31:04,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 04:31:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-23 04:31:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507829971] [2024-08-23 04:31:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:04,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-23 04:31:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-23 04:31:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-23 04:31:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:04,127 INFO L496 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-08-23 04:31:04,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:04,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:04,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-23 04:31:04,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:04,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 810427685, now seen corresponding path program 1 times [2024-08-23 04:31:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335428805] [2024-08-23 04:31:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:04,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335428805] [2024-08-23 04:31:04,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335428805] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 04:31:04,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 04:31:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-23 04:31:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69203069] [2024-08-23 04:31:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 04:31:04,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-23 04:31:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-23 04:31:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-23 04:31:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:04,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 04:31:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:04,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-23 04:31:04,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:04,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1337403684, now seen corresponding path program 1 times [2024-08-23 04:31:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240799656] [2024-08-23 04:31:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240799656] [2024-08-23 04:31:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240799656] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 04:31:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546306124] [2024-08-23 04:31:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:04,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 04:31:04,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:04,563 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-08-23 04:31:04,567 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-08-23 04:31:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:04,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-23 04:31:04,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 04:31:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:04,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 04:31:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:04,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546306124] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 04:31:04,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 04:31:04,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-08-23 04:31:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512153006] [2024-08-23 04:31:04,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 04:31:04,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-23 04:31:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-23 04:31:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-08-23 04:31:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:04,845 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:04,845 INFO L496 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-08-23 04:31:04,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:04,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:04,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:04,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 04:31:05,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-08-23 04:31:05,294 WARN L477 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-08-23 04:31:05,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:05,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1697688436, now seen corresponding path program 2 times [2024-08-23 04:31:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140223428] [2024-08-23 04:31:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140223428] [2024-08-23 04:31:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140223428] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 04:31:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028056861] [2024-08-23 04:31:05,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 04:31:05,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 04:31:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:05,656 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-08-23 04:31:05,659 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-08-23 04:31:05,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-23 04:31:05,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 04:31:05,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-23 04:31:05,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 04:31:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:05,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 04:31:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028056861] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 04:31:06,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 04:31:06,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2024-08-23 04:31:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798526117] [2024-08-23 04:31:06,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 04:31:06,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-23 04:31:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:06,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-23 04:31:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2024-08-23 04:31:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:06,177 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:06,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 32 states have internal predecessors, (102), 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-08-23 04:31:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-23 04:31:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 04:31:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-23 04:31:06,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-23 04:31:07,121 WARN L477 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-08-23 04:31:07,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:07,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1772977316, now seen corresponding path program 3 times [2024-08-23 04:31:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215923986] [2024-08-23 04:31:07,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 04:31:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 04:31:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215923986] [2024-08-23 04:31:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215923986] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 04:31:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586218377] [2024-08-23 04:31:08,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-23 04:31:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 04:31:08,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 04:31:08,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 04:31:08,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-23 04:31:08,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-08-23 04:31:08,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 04:31:08,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 35 conjunts are in the unsatisfiable core [2024-08-23 04:31:08,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 04:31:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:08,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 04:31:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 04:31:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586218377] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 04:31:09,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 04:31:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26, 26] total 58 [2024-08-23 04:31:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624195764] [2024-08-23 04:31:09,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 04:31:09,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-08-23 04:31:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 04:31:09,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-08-23 04:31:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=2606, Unknown=0, NotChecked=0, Total=3422 [2024-08-23 04:31:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:09,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 04:31:09,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.76271186440678) internal successors, (222), 58 states have internal predecessors, (222), 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-08-23 04:31:09,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:09,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:09,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:09,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-23 04:31:09,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-23 04:31:09,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 04:31:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 04:31:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-23 04:31:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-23 04:31:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 04:31:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-23 04:31:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-08-23 04:31:10,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-23 04:31:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-08-23 04:31:10,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-23 04:31:10,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 04:31:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1305287816, now seen corresponding path program 4 times [2024-08-23 04:31:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 04:31:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173429157] [2024-08-23 04:31:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 04:31:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 04:31:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 04:31:10,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-23 04:31:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 04:31:10,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-23 04:31:10,784 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-23 04:31:10,784 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-08-23 04:31:10,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-08-23 04:31:10,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-08-23 04:31:10,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-08-23 04:31:10,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-08-23 04:31:10,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-23 04:31:10,786 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-08-23 04:31:10,787 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-08-23 04:31:10,790 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-23 04:31:10,790 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-23 04:31:10,890 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-08-23 04:31:10,890 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-08-23 04:31:10,894 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 04:31:10 BasicIcfg [2024-08-23 04:31:10,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-23 04:31:10,894 INFO L158 Benchmark]: Toolchain (without parser) took 10961.73ms. Allocated memory was 174.1MB in the beginning and 369.1MB in the end (delta: 195.0MB). Free memory was 102.3MB in the beginning and 209.3MB in the end (delta: -106.9MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2024-08-23 04:31:10,894 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-23 04:31:10,894 INFO L158 Benchmark]: Witness Parser took 0.41ms. Allocated memory is still 174.1MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-23 04:31:10,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.43ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 137.2MB in the end (delta: -35.0MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-08-23 04:31:10,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.55ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-23 04:31:10,895 INFO L158 Benchmark]: Boogie Preprocessor took 31.34ms. Allocated memory is still 174.1MB. Free memory was 135.1MB in the beginning and 133.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-23 04:31:10,895 INFO L158 Benchmark]: RCFGBuilder took 486.23ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 109.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-23 04:31:10,895 INFO L158 Benchmark]: TraceAbstraction took 9819.58ms. Allocated memory was 174.1MB in the beginning and 369.1MB in the end (delta: 195.0MB). Free memory was 108.6MB in the beginning and 209.3MB in the end (delta: -100.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-08-23 04:31:10,896 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.41ms. Allocated memory is still 174.1MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.43ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 137.2MB in the end (delta: -35.0MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.55ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.34ms. Allocated memory is still 174.1MB. Free memory was 135.1MB in the beginning and 133.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 486.23ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 109.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9819.58ms. Allocated memory was 174.1MB in the beginning and 369.1MB in the end (delta: 195.0MB). Free memory was 108.6MB in the beginning and 209.3MB in the end (delta: -100.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3349, independent: 2809, independent conditional: 2382, independent unconditional: 427, dependent: 540, dependent conditional: 533, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2888, independent: 2809, independent conditional: 2382, independent unconditional: 427, dependent: 79, dependent conditional: 72, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2888, independent: 2809, independent conditional: 2382, independent unconditional: 427, dependent: 79, dependent conditional: 72, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3047, independent: 2809, independent conditional: 11, independent unconditional: 2798, dependent: 238, dependent conditional: 148, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3047, independent: 2809, independent conditional: 11, independent unconditional: 2798, dependent: 238, dependent conditional: 148, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3047, independent: 2809, independent conditional: 11, independent unconditional: 2798, dependent: 238, dependent conditional: 148, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 377, independent: 350, independent conditional: 4, independent unconditional: 346, dependent: 27, dependent conditional: 20, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 377, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 27, dependent conditional: 20, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 27, dependent conditional: 20, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 97, independent conditional: 14, independent unconditional: 83, dependent: 88, dependent conditional: 67, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3047, independent: 2459, independent conditional: 7, independent unconditional: 2452, dependent: 211, dependent conditional: 128, dependent unconditional: 83, unknown: 377, unknown conditional: 24, unknown unconditional: 353] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 350, Positive conditional cache size: 4, Positive unconditional cache size: 346, Negative cache size: 27, Negative conditional cache size: 20, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4, Independence queries for same thread: 461 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, 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: 3349, independent: 2809, independent conditional: 2382, independent unconditional: 427, dependent: 540, dependent conditional: 533, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2888, independent: 2809, independent conditional: 2382, independent unconditional: 427, dependent: 79, dependent conditional: 72, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2888, independent: 2809, independent conditional: 2382, independent unconditional: 427, dependent: 79, dependent conditional: 72, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3047, independent: 2809, independent conditional: 11, independent unconditional: 2798, dependent: 238, dependent conditional: 148, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3047, independent: 2809, independent conditional: 11, independent unconditional: 2798, dependent: 238, dependent conditional: 148, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3047, independent: 2809, independent conditional: 11, independent unconditional: 2798, dependent: 238, dependent conditional: 148, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 377, independent: 350, independent conditional: 4, independent unconditional: 346, dependent: 27, dependent conditional: 20, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 377, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 27, dependent conditional: 20, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 21, independent conditional: 4, independent unconditional: 17, dependent: 27, dependent conditional: 20, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 97, independent conditional: 14, independent unconditional: 83, dependent: 88, dependent conditional: 67, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3047, independent: 2459, independent conditional: 7, independent unconditional: 2452, dependent: 211, dependent conditional: 128, dependent unconditional: 83, unknown: 377, unknown conditional: 24, unknown unconditional: 353] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 350, Positive conditional cache size: 4, Positive unconditional cache size: 346, Negative cache size: 27, Negative conditional cache size: 20, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4, Independence queries for same thread: 461 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4514, independent: 3875, independent conditional: 3572, independent unconditional: 303, dependent: 639, dependent conditional: 633, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3886, independent: 3875, independent conditional: 3572, independent unconditional: 303, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3886, independent: 3875, independent conditional: 3572, independent unconditional: 303, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3930, independent: 3875, independent conditional: 39, independent unconditional: 3836, dependent: 55, dependent conditional: 5, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3930, independent: 3875, independent conditional: 39, independent unconditional: 3836, dependent: 55, dependent conditional: 3, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3930, independent: 3875, independent conditional: 39, independent unconditional: 3836, dependent: 55, dependent conditional: 3, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 328, independent: 319, independent conditional: 38, independent unconditional: 281, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 328, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 52, independent conditional: 38, independent unconditional: 14, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 52, independent conditional: 38, independent unconditional: 14, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 148, independent conditional: 89, independent unconditional: 59, dependent: 34, dependent conditional: 17, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3930, independent: 3556, independent conditional: 1, independent unconditional: 3555, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 328, unknown conditional: 41, unknown unconditional: 287] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 319, Positive conditional cache size: 38, Positive unconditional cache size: 281, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1, Independence queries for same thread: 628 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 24, Number of trivial persistent sets: 12, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 309, independent: 303, independent conditional: 0, independent unconditional: 303, 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: 4514, independent: 3875, independent conditional: 3572, independent unconditional: 303, dependent: 639, dependent conditional: 633, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3886, independent: 3875, independent conditional: 3572, independent unconditional: 303, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3886, independent: 3875, independent conditional: 3572, independent unconditional: 303, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3930, independent: 3875, independent conditional: 39, independent unconditional: 3836, dependent: 55, dependent conditional: 5, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3930, independent: 3875, independent conditional: 39, independent unconditional: 3836, dependent: 55, dependent conditional: 3, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3930, independent: 3875, independent conditional: 39, independent unconditional: 3836, dependent: 55, dependent conditional: 3, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 328, independent: 319, independent conditional: 38, independent unconditional: 281, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 328, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 52, independent conditional: 38, independent unconditional: 14, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 52, independent conditional: 38, independent unconditional: 14, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 148, independent conditional: 89, independent unconditional: 59, dependent: 34, dependent conditional: 17, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3930, independent: 3556, independent conditional: 1, independent unconditional: 3555, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 328, unknown conditional: 41, unknown unconditional: 287] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 319, Positive conditional cache size: 38, Positive unconditional cache size: 281, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1, Independence queries for same thread: 628 - 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)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((i % 2) == 1)) && ((j % 2) == 0)); [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=3, id1=-1, id2=0, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=45, j=44, k=19, k=19] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L706] 2 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((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=45, j=46, k=19, k=20] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 //@ assert (((((3 <= i) && (4 <= j)) && (((1LL - (long long) i) + (long long) j) >= 0LL)) && ((i % 2) == 1)) && ((j % 2) == 0)); [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=20, k=20] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=20, k=20] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=20, k=20] - UnprovableResult [Line: 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: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 40 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, 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: 17, 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, 1.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 2 NumberOfNonLiveVariables, 138 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: 7.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 2.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 99, 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, 3.4s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 3659 SizeOfPredicates, 50 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 4/1930 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-08-23 04:31:10,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-08-23 04:31:11,127 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-08-23 04:31:11,331 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