./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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-simpl-str-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-subst.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.extract-columns-fced0e8-m [2024-01-31 16:08:28,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:08:28,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:08:28,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:08:28,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:08:28,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:08:28,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:08:28,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:08:28,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:08:28,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:08:28,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:08:28,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:08:28,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:08:28,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:08:28,446 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:08:28,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:08:28,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:08:28,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:08:28,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:08:28,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:08:28,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:08:28,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:08:28,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:08:28,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:08:28,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:08:28,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:08:28,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:08:28,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:08:28,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:08:28,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:08:28,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:08:28,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:08:28,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:28,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:08:28,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:08:28,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:08:28,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:08:28,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:08:28,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:08:28,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:08:28,456 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:08:28,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:08:28,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:08:28,458 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-01-31 16:08:28,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:08:28,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:08:28,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:08:28,702 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:08:28,703 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:08:28,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-subst.wvr.yml/witness.yml [2024-01-31 16:08:28,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:08:28,826 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:08:28,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-01-31 16:08:29,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:08:29,972 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:08:29,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-01-31 16:08:29,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b59a38b4/b18b15cd99394c08adbed6a5d5b15d1d/FLAGe2596d76b [2024-01-31 16:08:29,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b59a38b4/b18b15cd99394c08adbed6a5d5b15d1d [2024-01-31 16:08:29,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:08:29,990 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:08:29,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:29,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:08:29,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:08:29,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:28" (1/2) ... [2024-01-31 16:08:29,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5276e665 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:29, skipping insertion in model container [2024-01-31 16:08:29,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:28" (1/2) ... [2024-01-31 16:08:29,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f6b4f87 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:29, skipping insertion in model container [2024-01-31 16:08:29,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:29" (2/2) ... [2024-01-31 16:08:29,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5276e665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:29, skipping insertion in model container [2024-01-31 16:08:29,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:29" (2/2) ... [2024-01-31 16:08:29,998 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:08:30,033 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:08:30,034 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (((((to_int_3 == 0) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,034 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((((((((length_0 == 0) && (to_int_1 == 0)) && (length_2 == 0)) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,034 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (b <= -1) && (b != 0) [2024-01-31 16:08:30,034 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,034 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((to_int_1 == 0) && (length_2 == 0)) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((((length_4 == 0) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_6 == 0) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (1 <= b) && (b != 0) [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-31 16:08:30,035 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((((((length_2 == 0) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-31 16:08:30,051 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:08:30,171 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2614,2627] [2024-01-31 16:08:30,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:30,191 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:08:30,235 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2614,2627] Start Parsing Local Start Parsing Local [2024-01-31 16:08:30,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:30,250 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:08:30,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30 WrapperNode [2024-01-31 16:08:30,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:30,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:30,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:08:30,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:08:30,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,316 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 191 [2024-01-31 16:08:30,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:30,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:08:30,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:08:30,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:08:30,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,367 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-01-31 16:08:30,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:08:30,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:08:30,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:08:30,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:08:30,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (1/1) ... [2024-01-31 16:08:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:30,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:08:30,413 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-01-31 16:08:30,429 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-01-31 16:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:08:30,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:08:30,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 16:08:30,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 16:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:08:30,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:08:30,452 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:08:30,546 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:08:30,548 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:08:30,821 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:08:30,823 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:08:31,054 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:08:31,055 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 16:08:31,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:31 BoogieIcfgContainer [2024-01-31 16:08:31,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:08:31,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:08:31,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:08:31,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:08:31,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:28" (1/4) ... [2024-01-31 16:08:31,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff51a6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:08:31, skipping insertion in model container [2024-01-31 16:08:31,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:08:29" (2/4) ... [2024-01-31 16:08:31,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff51a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:08:31, skipping insertion in model container [2024-01-31 16:08:31,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:30" (3/4) ... [2024-01-31 16:08:31,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff51a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:08:31, skipping insertion in model container [2024-01-31 16:08:31,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:31" (4/4) ... [2024-01-31 16:08:31,066 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-01-31 16:08:31,080 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:08:31,080 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-01-31 16:08:31,080 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:08:31,135 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-31 16:08:31,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 71 transitions, 163 flow [2024-01-31 16:08:31,212 INFO L124 PetriNetUnfolderBase]: 6/68 cut-off events. [2024-01-31 16:08:31,213 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 16:08:31,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 68 events. 6/68 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 157 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-01-31 16:08:31,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 71 transitions, 163 flow [2024-01-31 16:08:31,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 67 transitions, 152 flow [2024-01-31 16:08:31,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:08:31,234 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;@3e6924f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:08:31,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-01-31 16:08:31,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:08:31,236 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:08:31,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:31,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:31,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:08:31,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:31,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 17658, now seen corresponding path program 1 times [2024-01-31 16:08:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493402057] [2024-01-31 16:08:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493402057] [2024-01-31 16:08:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493402057] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252774549] [2024-01-31 16:08:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:31,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:31,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:31,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-01-31 16:08:31,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-01-31 16:08:31,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:31,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-01-31 16:08:31,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:32,073 INFO L124 PetriNetUnfolderBase]: 3281/5193 cut-off events. [2024-01-31 16:08:32,073 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-01-31 16:08:32,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9850 conditions, 5193 events. 3281/5193 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 32388 event pairs, 2653 based on Foata normal form. 0/4240 useless extension candidates. Maximal degree in co-relation 8903. Up to 4433 conditions per place. [2024-01-31 16:08:32,108 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-01-31 16:08:32,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 66 transitions, 250 flow [2024-01-31 16:08:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-01-31 16:08:32,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070422535211268 [2024-01-31 16:08:32,122 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 152 flow. Second operand 3 states and 108 transitions. [2024-01-31 16:08:32,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 66 transitions, 250 flow [2024-01-31 16:08:32,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-31 16:08:32,137 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 142 flow [2024-01-31 16:08:32,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-01-31 16:08:32,143 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2024-01-31 16:08:32,144 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 142 flow [2024-01-31 16:08:32,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-01-31 16:08:32,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:32,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:08:32,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:08:32,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:32,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash 547995, now seen corresponding path program 1 times [2024-01-31 16:08:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:32,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441873471] [2024-01-31 16:08:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441873471] [2024-01-31 16:08:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441873471] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316916196] [2024-01-31 16:08:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:32,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:32,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:32,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-01-31 16:08:32,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-31 16:08:32,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:32,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-01-31 16:08:32,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:32,608 INFO L124 PetriNetUnfolderBase]: 2514/4006 cut-off events. [2024-01-31 16:08:32,609 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-01-31 16:08:32,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 4006 events. 2514/4006 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 25838 event pairs, 2027 based on Foata normal form. 0/3461 useless extension candidates. Maximal degree in co-relation 7509. Up to 3449 conditions per place. [2024-01-31 16:08:32,629 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-01-31 16:08:32,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 234 flow [2024-01-31 16:08:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-01-31 16:08:32,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2024-01-31 16:08:32,636 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 142 flow. Second operand 3 states and 114 transitions. [2024-01-31 16:08:32,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 234 flow [2024-01-31 16:08:32,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:32,639 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 140 flow [2024-01-31 16:08:32,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-01-31 16:08:32,640 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -6 predicate places. [2024-01-31 16:08:32,640 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 140 flow [2024-01-31 16:08:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-31 16:08:32,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:32,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:08:32,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:08:32,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:32,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash 16988402, now seen corresponding path program 1 times [2024-01-31 16:08:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847551547] [2024-01-31 16:08:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847551547] [2024-01-31 16:08:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847551547] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:32,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294222245] [2024-01-31 16:08:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:32,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:32,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 71 [2024-01-31 16:08:32,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-01-31 16:08:32,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:32,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 71 [2024-01-31 16:08:32,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:33,028 INFO L124 PetriNetUnfolderBase]: 2514/4005 cut-off events. [2024-01-31 16:08:33,029 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-01-31 16:08:33,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7516 conditions, 4005 events. 2514/4005 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 25776 event pairs, 2027 based on Foata normal form. 0/3461 useless extension candidates. Maximal degree in co-relation 7505. Up to 3447 conditions per place. [2024-01-31 16:08:33,054 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-01-31 16:08:33,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 230 flow [2024-01-31 16:08:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-01-31 16:08:33,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446009389671361 [2024-01-31 16:08:33,059 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 140 flow. Second operand 3 states and 116 transitions. [2024-01-31 16:08:33,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 230 flow [2024-01-31 16:08:33,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:33,061 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 138 flow [2024-01-31 16:08:33,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-01-31 16:08:33,062 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2024-01-31 16:08:33,062 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 138 flow [2024-01-31 16:08:33,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-01-31 16:08:33,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:33,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:08:33,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:08:33,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:33,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash 526641033, now seen corresponding path program 1 times [2024-01-31 16:08:33,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:33,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441717139] [2024-01-31 16:08:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:33,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:33,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441717139] [2024-01-31 16:08:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441717139] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:33,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:33,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146786661] [2024-01-31 16:08:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:33,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:33,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:33,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:33,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 71 [2024-01-31 16:08:33,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-01-31 16:08:33,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:33,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 71 [2024-01-31 16:08:33,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:33,396 INFO L124 PetriNetUnfolderBase]: 2161/3504 cut-off events. [2024-01-31 16:08:33,396 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-31 16:08:33,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6625 conditions, 3504 events. 2161/3504 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23170 event pairs, 1782 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 6612. Up to 3056 conditions per place. [2024-01-31 16:08:33,416 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-01-31 16:08:33,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 224 flow [2024-01-31 16:08:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-01-31 16:08:33,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633802816901409 [2024-01-31 16:08:33,418 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 138 flow. Second operand 3 states and 120 transitions. [2024-01-31 16:08:33,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 224 flow [2024-01-31 16:08:33,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:33,421 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 136 flow [2024-01-31 16:08:33,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-01-31 16:08:33,422 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -8 predicate places. [2024-01-31 16:08:33,423 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 136 flow [2024-01-31 16:08:33,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-01-31 16:08:33,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:33,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:08:33,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:08:33,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:33,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -853996580, now seen corresponding path program 1 times [2024-01-31 16:08:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850685803] [2024-01-31 16:08:33,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:33,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850685803] [2024-01-31 16:08:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850685803] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:33,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:33,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788687661] [2024-01-31 16:08:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:33,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:33,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-01-31 16:08:33,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-31 16:08:33,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:33,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-01-31 16:08:33,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:33,656 INFO L124 PetriNetUnfolderBase]: 2161/3503 cut-off events. [2024-01-31 16:08:33,656 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-31 16:08:33,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6623 conditions, 3503 events. 2161/3503 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23117 event pairs, 1782 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 6608. Up to 3054 conditions per place. [2024-01-31 16:08:33,671 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-01-31 16:08:33,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 220 flow [2024-01-31 16:08:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-01-31 16:08:33,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727699530516432 [2024-01-31 16:08:33,672 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 136 flow. Second operand 3 states and 122 transitions. [2024-01-31 16:08:33,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 220 flow [2024-01-31 16:08:33,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:33,673 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 134 flow [2024-01-31 16:08:33,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-01-31 16:08:33,674 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2024-01-31 16:08:33,674 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 134 flow [2024-01-31 16:08:33,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-31 16:08:33,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:33,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:08:33,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:33,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -704089664, now seen corresponding path program 1 times [2024-01-31 16:08:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059833482] [2024-01-31 16:08:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059833482] [2024-01-31 16:08:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059833482] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321908103] [2024-01-31 16:08:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:33,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:33,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 71 [2024-01-31 16:08:33,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-01-31 16:08:33,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:33,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 71 [2024-01-31 16:08:33,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:33,893 INFO L124 PetriNetUnfolderBase]: 2161/3502 cut-off events. [2024-01-31 16:08:33,894 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-31 16:08:33,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 3502 events. 2161/3502 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23131 event pairs, 1782 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 6604. Up to 3052 conditions per place. [2024-01-31 16:08:33,908 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 40 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-01-31 16:08:33,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 216 flow [2024-01-31 16:08:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-01-31 16:08:33,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821596244131455 [2024-01-31 16:08:33,910 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 134 flow. Second operand 3 states and 124 transitions. [2024-01-31 16:08:33,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 216 flow [2024-01-31 16:08:33,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:33,912 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 132 flow [2024-01-31 16:08:33,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-01-31 16:08:33,915 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2024-01-31 16:08:33,915 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 132 flow [2024-01-31 16:08:33,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-01-31 16:08:33,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:33,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:33,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:08:33,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:33,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -351942509, now seen corresponding path program 1 times [2024-01-31 16:08:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486074450] [2024-01-31 16:08:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:33,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486074450] [2024-01-31 16:08:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486074450] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:33,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690028598] [2024-01-31 16:08:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:33,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 71 [2024-01-31 16:08:33,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-01-31 16:08:33,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:33,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 71 [2024-01-31 16:08:33,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:34,187 INFO L124 PetriNetUnfolderBase]: 2157/3518 cut-off events. [2024-01-31 16:08:34,188 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-31 16:08:34,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 3518 events. 2157/3518 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 23801 event pairs, 712 based on Foata normal form. 0/3082 useless extension candidates. Maximal degree in co-relation 6617. Up to 2003 conditions per place. [2024-01-31 16:08:34,199 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 60 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2024-01-31 16:08:34,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 306 flow [2024-01-31 16:08:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-01-31 16:08:34,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-01-31 16:08:34,201 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 132 flow. Second operand 3 states and 149 transitions. [2024-01-31 16:08:34,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 306 flow [2024-01-31 16:08:34,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:34,202 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 150 flow [2024-01-31 16:08:34,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-01-31 16:08:34,203 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2024-01-31 16:08:34,203 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 150 flow [2024-01-31 16:08:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-01-31 16:08:34,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:34,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:34,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:08:34,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-31 16:08:34,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1733425579, now seen corresponding path program 1 times [2024-01-31 16:08:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967683811] [2024-01-31 16:08:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:34,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:08:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:34,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:08:34,258 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:08:34,259 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 29 remaining) [2024-01-31 16:08:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 29 remaining) [2024-01-31 16:08:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 29 remaining) [2024-01-31 16:08:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 29 remaining) [2024-01-31 16:08:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 29 remaining) [2024-01-31 16:08:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 29 remaining) [2024-01-31 16:08:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 29 remaining) [2024-01-31 16:08:34,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 29 remaining) [2024-01-31 16:08:34,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 29 remaining) [2024-01-31 16:08:34,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 29 remaining) [2024-01-31 16:08:34,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 29 remaining) [2024-01-31 16:08:34,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2024-01-31 16:08:34,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2024-01-31 16:08:34,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2024-01-31 16:08:34,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 29 remaining) [2024-01-31 16:08:34,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 29 remaining) [2024-01-31 16:08:34,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 29 remaining) [2024-01-31 16:08:34,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:08:34,269 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:34,274 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:08:34,274 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:08:34,303 INFO L503 ceAbstractionStarter]: Automizer considered 16 witness invariants [2024-01-31 16:08:34,303 INFO L504 ceAbstractionStarter]: WitnessConsidered=16 [2024-01-31 16:08:34,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:08:34 BasicIcfg [2024-01-31 16:08:34,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:08:34,305 INFO L158 Benchmark]: Toolchain (without parser) took 4314.94ms. Allocated memory was 188.7MB in the beginning and 463.5MB in the end (delta: 274.7MB). Free memory was 158.0MB in the beginning and 311.6MB in the end (delta: -153.6MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2024-01-31 16:08:34,305 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:34,305 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 130.0MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:34,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.40ms. Allocated memory is still 188.7MB. Free memory was 158.0MB in the beginning and 141.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-31 16:08:34,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.85ms. Allocated memory is still 188.7MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:34,307 INFO L158 Benchmark]: Boogie Preprocessor took 67.35ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 136.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:34,307 INFO L158 Benchmark]: RCFGBuilder took 670.64ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 147.7MB in the end (delta: -11.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-01-31 16:08:34,309 INFO L158 Benchmark]: TraceAbstraction took 3245.54ms. Allocated memory was 188.7MB in the beginning and 463.5MB in the end (delta: 274.7MB). Free memory was 146.7MB in the beginning and 311.6MB in the end (delta: -165.0MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2024-01-31 16:08:34,310 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.17ms. Allocated memory is still 130.0MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 130.0MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.40ms. Allocated memory is still 188.7MB. Free memory was 158.0MB in the beginning and 141.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.85ms. Allocated memory is still 188.7MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.35ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 136.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 670.64ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 147.7MB in the end (delta: -11.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3245.54ms. Allocated memory was 188.7MB in the beginning and 463.5MB in the end (delta: 274.7MB). Free memory was 146.7MB in the beginning and 311.6MB in the end (delta: -165.0MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, length_4, to_int_5, result_6, result_7, result_8; [L61] 0 pthread_t t1, t2, t3; VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=-2, to_int_3=0, to_int_5=0] [L43] 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : minus(to_int_1, to_int_3)) VAL [_argptr={0:0}, _argptr={0:0}, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=-2, to_int_3=0, to_int_5=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L87] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=-2, to_int_3=0, to_int_5=0] - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 105 locations, 29 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.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 25 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:08:34,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE