./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/chl-sre-trans.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c ./goblint.2024-05-07_14-17-48.files/protection/chl-sre-trans.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_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-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:53:06,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:53:06,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:53:06,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:53:06,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:53:06,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:53:06,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:53:06,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:53:06,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:53:06,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:53:06,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:53:06,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:53:06,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:53:06,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:53:06,218 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:53:06,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:53:06,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:53:06,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:53:06,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:53:06,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:53:06,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:53:06,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:53:06,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:53:06,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:53:06,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:53:06,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:53:06,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:53:06,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:53:06,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:53:06,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:53:06,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:53:06,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:53:06,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:53:06,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:53:06,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:53:06,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:53:06,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:53:06,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:53:06,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:53:06,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:53:06,224 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:53:06,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:53:06,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:53:06,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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-05-12 12:53:06,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:53:06,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:53:06,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:53:06,473 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:53:06,474 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:53:06,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/chl-sre-trans.wvr.yml/witness.yml [2024-05-12 12:53:06,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:53:06,656 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:53:06,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c [2024-05-12 12:53:07,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:53:08,009 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:53:08,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c [2024-05-12 12:53:08,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d5f27ce/c9153e4214784c17aadfceeeff6e527c/FLAG3c9491d45 [2024-05-12 12:53:08,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d5f27ce/c9153e4214784c17aadfceeeff6e527c [2024-05-12 12:53:08,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:53:08,032 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:53:08,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:53:08,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:53:08,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:53:08,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:53:06" (1/2) ... [2024-05-12 12:53:08,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70eeea49 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:08, skipping insertion in model container [2024-05-12 12:53:08,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:53:06" (1/2) ... [2024-05-12 12:53:08,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@222f1a3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:08, skipping insertion in model container [2024-05-12 12:53:08,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:53:08" (2/2) ... [2024-05-12 12:53:08,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70eeea49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08, skipping insertion in model container [2024-05-12 12:53:08,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:53:08" (2/2) ... [2024-05-12 12:53:08,044 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:53:08,063 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:53:08,065 INFO L97 edCorrectnessWitness]: Location invariant before [L71-L71] ((! multithreaded || ((((-128 <= result_5 && -1 <= result_5) && result_5 <= 1) && result_5 <= 127) && ((result_5 == -1 || result_5 == 0) || result_5 == 1))) && (! multithreaded || ((((-128 <= result_4 && -1 <= result_4) && result_4 <= 1) && result_4 <= 127) && ((result_4 == -1 || result_4 == 0) || result_4 == 1)))) && (! multithreaded || ((((-128 <= result_3 && -1 <= result_3) && result_3 <= 1) && result_3 <= 127) && ((result_3 == -1 || result_3 == 0) || result_3 == 1))) [2024-05-12 12:53:08,065 INFO L97 edCorrectnessWitness]: Location invariant before [L70-L70] ((! multithreaded || ((((-128 <= result_5 && -1 <= result_5) && result_5 <= 1) && result_5 <= 127) && ((result_5 == -1 || result_5 == 0) || result_5 == 1))) && (! multithreaded || ((((-128 <= result_4 && -1 <= result_4) && result_4 <= 1) && result_4 <= 127) && ((result_4 == -1 || result_4 == 0) || result_4 == 1)))) && (! multithreaded || ((((-128 <= result_3 && -1 <= result_3) && result_3 <= 1) && result_3 <= 127) && ((result_3 == -1 || result_3 == 0) || result_3 == 1))) [2024-05-12 12:53:08,068 INFO L97 edCorrectnessWitness]: Location invariant before [L69-L69] ((! multithreaded || ((((-128 <= result_5 && -1 <= result_5) && result_5 <= 1) && result_5 <= 127) && ((result_5 == -1 || result_5 == 0) || result_5 == 1))) && (! multithreaded || ((((-128 <= result_4 && -1 <= result_4) && result_4 <= 1) && result_4 <= 127) && ((result_4 == -1 || result_4 == 0) || result_4 == 1)))) && (! multithreaded || ((((-128 <= result_3 && -1 <= result_3) && result_3 <= 1) && result_3 <= 127) && ((result_3 == -1 || result_3 == 0) || result_3 == 1))) [2024-05-12 12:53:08,068 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:53:08,068 INFO L106 edCorrectnessWitness]: ghost_update [L68-L68] multithreaded = 1; [2024-05-12 12:53:08,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:53:08,264 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c[2272,2285] [2024-05-12 12:53:08,268 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:53:08,276 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:53:08,347 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c[2272,2285] [2024-05-12 12:53:08,348 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:53:08,374 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:53:08,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08 WrapperNode [2024-05-12 12:53:08,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:53:08,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:53:08,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:53:08,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:53:08,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,433 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-05-12 12:53:08,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:53:08,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:53:08,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:53:08,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:53:08,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,452 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 12:53:08,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:53:08,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:53:08,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:53:08,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:53:08,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (1/1) ... [2024-05-12 12:53:08,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:53:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:53:08,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 12:53:08,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 12:53:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:53:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 12:53:08,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 12:53:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 12:53:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 12:53:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 12:53:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 12:53:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:53:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:53:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:53:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:53:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:53:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:53:08,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:53:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:53:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:53:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:53:08,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:53:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:53:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:53:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:53:08,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 12:53:08,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:53:08,531 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:53:08,636 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:53:08,638 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:53:08,805 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:53:08,806 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:53:08,989 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:53:08,990 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:53:08,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:53:08 BoogieIcfgContainer [2024-05-12 12:53:08,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:53:08,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:53:08,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:53:08,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:53:08,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:53:06" (1/4) ... [2024-05-12 12:53:08,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2b43 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:53:08, skipping insertion in model container [2024-05-12 12:53:08,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:53:08" (2/4) ... [2024-05-12 12:53:08,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:53:08, skipping insertion in model container [2024-05-12 12:53:08,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:08" (3/4) ... [2024-05-12 12:53:08,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:53:08, skipping insertion in model container [2024-05-12 12:53:08,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:53:08" (4/4) ... [2024-05-12 12:53:08,999 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-sre-trans.wvr.c [2024-05-12 12:53:09,013 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:53:09,013 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:53:09,013 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:53:09,092 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-12 12:53:09,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 79 flow [2024-05-12 12:53:09,146 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-05-12 12:53:09,147 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-05-12 12:53:09,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 0/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-05-12 12:53:09,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 29 transitions, 79 flow [2024-05-12 12:53:09,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 68 flow [2024-05-12 12:53:09,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:53:09,174 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=PETRI_NET, 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;@2826ac17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:53:09,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:53:09,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:53:09,177 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:53:09,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:53:09,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:09,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:53:09,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:09,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1884829121, now seen corresponding path program 1 times [2024-05-12 12:53:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78082253] [2024-05-12 12:53:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78082253] [2024-05-12 12:53:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78082253] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:53:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284137903] [2024-05-12 12:53:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:53:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:53:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:53:09,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:09,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 6.0) 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-05-12 12:53:09,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:09,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:09,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:09,766 INFO L124 PetriNetUnfolderBase]: 65/136 cut-off events. [2024-05-12 12:53:09,766 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-05-12 12:53:09,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 136 events. 65/136 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 359 event pairs, 19 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 238. Up to 124 conditions per place. [2024-05-12 12:53:09,773 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2024-05-12 12:53:09,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 166 flow [2024-05-12 12:53:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-05-12 12:53:09,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-05-12 12:53:09,784 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 68 flow. Second operand 3 states and 50 transitions. [2024-05-12 12:53:09,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 166 flow [2024-05-12 12:53:09,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 12:53:09,789 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 86 flow [2024-05-12 12:53:09,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2024-05-12 12:53:09,793 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-05-12 12:53:09,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 86 flow [2024-05-12 12:53:09,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) 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-05-12 12:53:09,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:09,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:09,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:53:09,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:09,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1699838757, now seen corresponding path program 1 times [2024-05-12 12:53:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738208671] [2024-05-12 12:53:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:10,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:10,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738208671] [2024-05-12 12:53:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738208671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122310100] [2024-05-12 12:53:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:10,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:10,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:10,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-05-12 12:53:10,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:10,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:10,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:10,141 INFO L124 PetriNetUnfolderBase]: 62/130 cut-off events. [2024-05-12 12:53:10,141 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-05-12 12:53:10,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 130 events. 62/130 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 329 event pairs, 12 based on Foata normal form. 3/133 useless extension candidates. Maximal degree in co-relation 157. Up to 99 conditions per place. [2024-05-12 12:53:10,143 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-05-12 12:53:10,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 176 flow [2024-05-12 12:53:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-05-12 12:53:10,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-05-12 12:53:10,148 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 86 flow. Second operand 3 states and 48 transitions. [2024-05-12 12:53:10,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 176 flow [2024-05-12 12:53:10,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:10,153 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 109 flow [2024-05-12 12:53:10,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2024-05-12 12:53:10,154 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2024-05-12 12:53:10,154 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 109 flow [2024-05-12 12:53:10,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-05-12 12:53:10,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:10,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:10,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:53:10,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:10,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:10,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2050783433, now seen corresponding path program 1 times [2024-05-12 12:53:10,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100447988] [2024-05-12 12:53:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:10,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100447988] [2024-05-12 12:53:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100447988] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197778723] [2024-05-12 12:53:10,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:10,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:10,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:10,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05-12 12:53:10,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:10,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:10,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:10,416 INFO L124 PetriNetUnfolderBase]: 59/125 cut-off events. [2024-05-12 12:53:10,416 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-05-12 12:53:10,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 125 events. 59/125 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 306 event pairs, 14 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 118. Up to 102 conditions per place. [2024-05-12 12:53:10,418 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-05-12 12:53:10,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 213 flow [2024-05-12 12:53:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-05-12 12:53:10,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-05-12 12:53:10,421 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 109 flow. Second operand 3 states and 48 transitions. [2024-05-12 12:53:10,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 213 flow [2024-05-12 12:53:10,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:10,424 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 137 flow [2024-05-12 12:53:10,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-05-12 12:53:10,425 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2024-05-12 12:53:10,425 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 137 flow [2024-05-12 12:53:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05-12 12:53:10,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:10,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:10,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:53:10,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:10,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -850223641, now seen corresponding path program 1 times [2024-05-12 12:53:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:10,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389307764] [2024-05-12 12:53:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:10,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:10,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389307764] [2024-05-12 12:53:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389307764] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:53:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777388654] [2024-05-12 12:53:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:10,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:10,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:10,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:10,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-05-12 12:53:10,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:10,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:10,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:10,706 INFO L124 PetriNetUnfolderBase]: 58/122 cut-off events. [2024-05-12 12:53:10,706 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-05-12 12:53:10,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 122 events. 58/122 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 270 event pairs, 20 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 185. Up to 70 conditions per place. [2024-05-12 12:53:10,708 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-05-12 12:53:10,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 213 flow [2024-05-12 12:53:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-05-12 12:53:10,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2024-05-12 12:53:10,711 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 137 flow. Second operand 3 states and 44 transitions. [2024-05-12 12:53:10,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 213 flow [2024-05-12 12:53:10,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:10,715 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 141 flow [2024-05-12 12:53:10,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2024-05-12 12:53:10,716 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-05-12 12:53:10,716 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 141 flow [2024-05-12 12:53:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-05-12 12:53:10,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:10,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:10,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:53:10,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:10,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1023695523, now seen corresponding path program 1 times [2024-05-12 12:53:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:10,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077408457] [2024-05-12 12:53:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077408457] [2024-05-12 12:53:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077408457] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:10,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960547092] [2024-05-12 12:53:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:10,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:10,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:10,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:10,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-05-12 12:53:10,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:10,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:10,895 INFO L124 PetriNetUnfolderBase]: 56/119 cut-off events. [2024-05-12 12:53:10,896 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-05-12 12:53:10,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 119 events. 56/119 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 10 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 193. Up to 102 conditions per place. [2024-05-12 12:53:10,898 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 34 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2024-05-12 12:53:10,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 249 flow [2024-05-12 12:53:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-05-12 12:53:10,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2024-05-12 12:53:10,901 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 141 flow. Second operand 3 states and 46 transitions. [2024-05-12 12:53:10,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 249 flow [2024-05-12 12:53:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:10,906 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 164 flow [2024-05-12 12:53:10,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2024-05-12 12:53:10,908 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-05-12 12:53:10,908 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 164 flow [2024-05-12 12:53:10,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-05-12 12:53:10,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:10,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:10,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:53:10,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:10,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1669791125, now seen corresponding path program 1 times [2024-05-12 12:53:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674601191] [2024-05-12 12:53:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:11,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674601191] [2024-05-12 12:53:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674601191] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:11,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:53:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036077181] [2024-05-12 12:53:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:11,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:11,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:11,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-05-12 12:53:11,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:11,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:11,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:11,172 INFO L124 PetriNetUnfolderBase]: 55/117 cut-off events. [2024-05-12 12:53:11,172 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-05-12 12:53:11,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 117 events. 55/117 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 265 event pairs, 16 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 195. Up to 69 conditions per place. [2024-05-12 12:53:11,174 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-05-12 12:53:11,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 256 flow [2024-05-12 12:53:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-05-12 12:53:11,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2024-05-12 12:53:11,177 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 164 flow. Second operand 3 states and 44 transitions. [2024-05-12 12:53:11,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 256 flow [2024-05-12 12:53:11,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:11,179 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 176 flow [2024-05-12 12:53:11,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2024-05-12 12:53:11,180 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2024-05-12 12:53:11,180 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 176 flow [2024-05-12 12:53:11,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-05-12 12:53:11,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:11,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:11,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:53:11,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:11,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1669790164, now seen corresponding path program 1 times [2024-05-12 12:53:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954752161] [2024-05-12 12:53:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:11,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954752161] [2024-05-12 12:53:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954752161] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:11,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:11,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:53:11,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858181593] [2024-05-12 12:53:11,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:11,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:11,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:11,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:11,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:11,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:11,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-05-12 12:53:11,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:11,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:11,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:11,392 INFO L124 PetriNetUnfolderBase]: 54/115 cut-off events. [2024-05-12 12:53:11,392 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-05-12 12:53:11,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 115 events. 54/115 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 258 event pairs, 17 based on Foata normal form. 1/116 useless extension candidates. Maximal degree in co-relation 162. Up to 79 conditions per place. [2024-05-12 12:53:11,393 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2024-05-12 12:53:11,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 272 flow [2024-05-12 12:53:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2024-05-12 12:53:11,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-05-12 12:53:11,394 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 176 flow. Second operand 3 states and 45 transitions. [2024-05-12 12:53:11,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 272 flow [2024-05-12 12:53:11,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:11,396 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 183 flow [2024-05-12 12:53:11,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-05-12 12:53:11,396 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-05-12 12:53:11,396 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 183 flow [2024-05-12 12:53:11,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-05-12 12:53:11,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:11,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:11,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:53:11,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:11,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash -223917346, now seen corresponding path program 1 times [2024-05-12 12:53:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817761137] [2024-05-12 12:53:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817761137] [2024-05-12 12:53:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817761137] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:53:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457026679] [2024-05-12 12:53:11,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:11,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:11,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:11,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:11,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 12:53:11,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-05-12 12:53:11,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:11,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 12:53:11,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:11,721 INFO L124 PetriNetUnfolderBase]: 54/114 cut-off events. [2024-05-12 12:53:11,722 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-05-12 12:53:11,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 114 events. 54/114 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 241 event pairs, 17 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 144. Up to 77 conditions per place. [2024-05-12 12:53:11,723 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-05-12 12:53:11,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 261 flow [2024-05-12 12:53:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:53:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:53:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-05-12 12:53:11,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-05-12 12:53:11,724 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 183 flow. Second operand 4 states and 48 transitions. [2024-05-12 12:53:11,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 261 flow [2024-05-12 12:53:11,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 12:53:11,725 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 152 flow [2024-05-12 12:53:11,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-05-12 12:53:11,726 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-05-12 12:53:11,726 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 152 flow [2024-05-12 12:53:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-05-12 12:53:11,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:11,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:53:11,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:11,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1709313815, now seen corresponding path program 1 times [2024-05-12 12:53:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853845508] [2024-05-12 12:53:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853845508] [2024-05-12 12:53:11,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853845508] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:11,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:11,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118023341] [2024-05-12 12:53:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:11,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:11,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:11,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:11,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 12:53:11,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 12:53:11,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:11,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 12:53:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:12,095 INFO L124 PetriNetUnfolderBase]: 58/146 cut-off events. [2024-05-12 12:53:12,096 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-05-12 12:53:12,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 146 events. 58/146 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 445 event pairs, 8 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 127. Up to 69 conditions per place. [2024-05-12 12:53:12,097 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 42 selfloop transitions, 8 changer transitions 12/63 dead transitions. [2024-05-12 12:53:12,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 356 flow [2024-05-12 12:53:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-05-12 12:53:12,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-05-12 12:53:12,098 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 152 flow. Second operand 6 states and 100 transitions. [2024-05-12 12:53:12,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 356 flow [2024-05-12 12:53:12,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:12,101 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 161 flow [2024-05-12 12:53:12,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-05-12 12:53:12,101 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2024-05-12 12:53:12,102 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 161 flow [2024-05-12 12:53:12,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 12:53:12,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:12,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:12,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:53:12,104 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:12,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -134279795, now seen corresponding path program 2 times [2024-05-12 12:53:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053360010] [2024-05-12 12:53:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053360010] [2024-05-12 12:53:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053360010] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36897875] [2024-05-12 12:53:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:12,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:12,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 12:53:12,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 12:53:12,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:12,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 12:53:12,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:12,451 INFO L124 PetriNetUnfolderBase]: 47/140 cut-off events. [2024-05-12 12:53:12,451 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2024-05-12 12:53:12,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 140 events. 47/140 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 456 event pairs, 2 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 511. Up to 65 conditions per place. [2024-05-12 12:53:12,452 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 38 selfloop transitions, 7 changer transitions 13/59 dead transitions. [2024-05-12 12:53:12,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 355 flow [2024-05-12 12:53:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-05-12 12:53:12,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2024-05-12 12:53:12,454 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 161 flow. Second operand 6 states and 98 transitions. [2024-05-12 12:53:12,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 355 flow [2024-05-12 12:53:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 331 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 12:53:12,456 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 146 flow [2024-05-12 12:53:12,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2024-05-12 12:53:12,457 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2024-05-12 12:53:12,457 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 146 flow [2024-05-12 12:53:12,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 12:53:12,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:12,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:12,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:53:12,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:12,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash -781133269, now seen corresponding path program 3 times [2024-05-12 12:53:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885295596] [2024-05-12 12:53:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:12,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885295596] [2024-05-12 12:53:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885295596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:53:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530743731] [2024-05-12 12:53:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:12,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:12,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:12,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:12,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 12:53:12,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:12,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:12,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 12:53:12,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:12,759 INFO L124 PetriNetUnfolderBase]: 31/96 cut-off events. [2024-05-12 12:53:12,759 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-05-12 12:53:12,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 96 events. 31/96 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 247 event pairs, 6 based on Foata normal form. 2/98 useless extension candidates. Maximal degree in co-relation 360. Up to 40 conditions per place. [2024-05-12 12:53:12,760 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 24 selfloop transitions, 3 changer transitions 19/47 dead transitions. [2024-05-12 12:53:12,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 282 flow [2024-05-12 12:53:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:53:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:53:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-05-12 12:53:12,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-05-12 12:53:12,761 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 146 flow. Second operand 5 states and 80 transitions. [2024-05-12 12:53:12,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 282 flow [2024-05-12 12:53:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 258 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:53:12,762 INFO L231 Difference]: Finished difference. Result has 43 places, 22 transitions, 83 flow [2024-05-12 12:53:12,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2024-05-12 12:53:12,763 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2024-05-12 12:53:12,763 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 22 transitions, 83 flow [2024-05-12 12:53:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:12,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:12,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:12,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:53:12,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:53:12,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1694528769, now seen corresponding path program 4 times [2024-05-12 12:53:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284492512] [2024-05-12 12:53:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:12,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284492512] [2024-05-12 12:53:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284492512] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458276935] [2024-05-12 12:53:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:12,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:12,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 12:53:12,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 22 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 12:53:12,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:12,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 12:53:12,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:13,055 INFO L124 PetriNetUnfolderBase]: 8/36 cut-off events. [2024-05-12 12:53:13,056 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-05-12 12:53:13,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 36 events. 8/36 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2024-05-12 12:53:13,056 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2024-05-12 12:53:13,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 150 flow [2024-05-12 12:53:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-05-12 12:53:13,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40804597701149425 [2024-05-12 12:53:13,057 INFO L175 Difference]: Start difference. First operand has 43 places, 22 transitions, 83 flow. Second operand 6 states and 71 transitions. [2024-05-12 12:53:13,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 150 flow [2024-05-12 12:53:13,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 124 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-05-12 12:53:13,058 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2024-05-12 12:53:13,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2024-05-12 12:53:13,059 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-05-12 12:53:13,059 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2024-05-12 12:53:13,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 12:53:13,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 7 remaining) [2024-05-12 12:53:13,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-05-12 12:53:13,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 12:53:13,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-12 12:53:13,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 12:53:13,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 12:53:13,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-05-12 12:53:13,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:53:13,063 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:13,065 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 12:53:13,065 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 12:53:13,068 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-05-12 12:53:13,068 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-05-12 12:53:13,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 12:53:13 BasicIcfg [2024-05-12 12:53:13,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 12:53:13,069 INFO L158 Benchmark]: Toolchain (without parser) took 5036.98ms. Allocated memory was 159.4MB in the beginning and 320.9MB in the end (delta: 161.5MB). Free memory was 82.8MB in the beginning and 143.4MB in the end (delta: -60.6MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2024-05-12 12:53:13,069 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 126.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:53:13,070 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:53:13,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.14ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 82.6MB in the beginning and 208.2MB in the end (delta: -125.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-05-12 12:53:13,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.61ms. Allocated memory is still 247.5MB. Free memory was 208.2MB in the beginning and 206.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 12:53:13,070 INFO L158 Benchmark]: Boogie Preprocessor took 27.87ms. Allocated memory is still 247.5MB. Free memory was 206.1MB in the beginning and 204.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 12:53:13,071 INFO L158 Benchmark]: RCFGBuilder took 528.16ms. Allocated memory is still 247.5MB. Free memory was 204.0MB in the beginning and 171.5MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-05-12 12:53:13,071 INFO L158 Benchmark]: TraceAbstraction took 4076.93ms. Allocated memory was 247.5MB in the beginning and 320.9MB in the end (delta: 73.4MB). Free memory was 171.5MB in the beginning and 143.4MB in the end (delta: 28.1MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2024-05-12 12:53:13,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 126.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.14ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 82.6MB in the beginning and 208.2MB in the end (delta: -125.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.61ms. Allocated memory is still 247.5MB. Free memory was 208.2MB in the beginning and 206.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.87ms. Allocated memory is still 247.5MB. Free memory was 206.1MB in the beginning and 204.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.16ms. Allocated memory is still 247.5MB. Free memory was 204.0MB in the beginning and 171.5MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4076.93ms. Allocated memory was 247.5MB in the beginning and 320.9MB in the end (delta: 73.4MB). Free memory was 171.5MB in the beginning and 143.4MB in the end (delta: 28.1MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 69]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 70]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 71]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 39 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 818 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 7 mSDtfsCounter, 818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=7, InterpolantAutomatonStates: 48, 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, 2.1s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 1148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-12 12:53:13,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE