./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i --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/13-privatized_41-traces-ex-7_unknown_1_pos.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_41-traces-ex-7_unknown_1_pos.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-dev-59af5db-m [2024-02-02 09:36:20,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:36:20,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:36:20,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:36:20,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:36:20,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:36:20,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:36:20,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:36:20,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:36:20,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:36:20,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:36:20,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:36:20,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:36:20,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:36:20,617 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:36:20,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:36:20,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:36:20,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:36:20,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:36:20,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:36:20,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:36:20,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:36:20,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:36:20,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:36:20,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:36:20,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:36:20,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:36:20,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:36:20,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:36:20,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:36:20,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:36:20,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:36:20,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:20,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:36:20,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:36:20,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:36:20,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:36:20,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:36:20,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:36:20,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:36:20,623 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:36:20,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:36:20,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:36:20,624 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-02-02 09:36:20,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:36:20,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:36:20,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:36:20,855 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:36:20,856 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:36:20,857 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/13-privatized_41-traces-ex-7_unknown_1_pos.yml/witness.yml [2024-02-02 09:36:21,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:36:21,036 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:36:21,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-02-02 09:36:22,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:36:22,382 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:36:22,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-02-02 09:36:22,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601ff292f/923a7d27eaf14640962485394e249425/FLAG3f618022a [2024-02-02 09:36:22,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601ff292f/923a7d27eaf14640962485394e249425 [2024-02-02 09:36:22,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:36:22,415 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:36:22,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:22,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:36:22,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:36:22,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:21" (1/2) ... [2024-02-02 09:36:22,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed6194b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:22, skipping insertion in model container [2024-02-02 09:36:22,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:21" (1/2) ... [2024-02-02 09:36:22,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6406fa94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:22, skipping insertion in model container [2024-02-02 09:36:22,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:22" (2/2) ... [2024-02-02 09:36:22,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed6194b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22, skipping insertion in model container [2024-02-02 09:36:22,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:22" (2/2) ... [2024-02-02 09:36:22,425 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:36:22,473 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:36:22,474 INFO L101 nessWitnessExtractor]: Location invariant before [L696-L696] ((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17) [2024-02-02 09:36:22,474 INFO L101 nessWitnessExtractor]: Location invariant before [L698-L698] ((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17) [2024-02-02 09:36:22,475 INFO L101 nessWitnessExtractor]: Location invariant before [L699-L699] ((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17) [2024-02-02 09:36:22,475 INFO L101 nessWitnessExtractor]: Location invariant before [L687-L687] (((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && ((unsigned long )arg == 0UL)) && (g == 0 || g == 17) [2024-02-02 09:36:22,475 INFO L101 nessWitnessExtractor]: Location invariant before [L694-L694] g == 0 [2024-02-02 09:36:22,475 INFO L101 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((((((((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17)) && (0 <= g)) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17)) && (0 <= g)) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17) [2024-02-02 09:36:22,476 INFO L101 nessWitnessExtractor]: Location invariant before [L690-L690] (unsigned long )arg == 0UL [2024-02-02 09:36:22,476 INFO L101 nessWitnessExtractor]: Location invariant before [L686-L686] (((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && ((unsigned long )arg == 0UL)) && (g == 0 || g == 17) [2024-02-02 09:36:22,476 INFO L101 nessWitnessExtractor]: Location invariant before [L697-L697] ((((0 <= g) && (g <= 17)) && (g <= 127)) && (g % 17 == 0)) && (g == 0 || g == 17) [2024-02-02 09:36:22,476 INFO L101 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-02-02 09:36:22,476 INFO L101 nessWitnessExtractor]: Location invariant before [L689-L689] (g == 17) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:22,476 INFO L101 nessWitnessExtractor]: Location invariant before [L688-L688] (g == 17) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:22,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:36:22,683 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2024-02-02 09:36:22,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:22,841 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:36:22,853 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2024-02-02 09:36:22,853 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry 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 Start Parsing Local [2024-02-02 09:36:22,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:22,975 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:36:22,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22 WrapperNode [2024-02-02 09:36:22,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:22,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:22,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:36:22,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:36:22,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:22,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,015 INFO L138 Inliner]: procedures = 163, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-02-02 09:36:23,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:23,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:36:23,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:36:23,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:36:23,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,041 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 5, 1, 5]. 38 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 0, 5]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-02-02 09:36:23,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:36:23,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:36:23,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:36:23,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:36:23,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (1/1) ... [2024-02-02 09:36:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:23,124 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-02-02 09:36:23,126 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-02-02 09:36:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:36:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:36:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:36:23,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:36:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:36:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:36:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-02-02 09:36:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:36:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:36:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:36:23,160 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:36:23,253 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:36:23,254 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:36:23,432 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:36:23,432 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:36:23,509 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:36:23,509 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:36:23,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:23 BoogieIcfgContainer [2024-02-02 09:36:23,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:36:23,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:36:23,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:36:23,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:36:23,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:21" (1/4) ... [2024-02-02 09:36:23,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eba26bf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:36:23, skipping insertion in model container [2024-02-02 09:36:23,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:36:22" (2/4) ... [2024-02-02 09:36:23,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eba26bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:23, skipping insertion in model container [2024-02-02 09:36:23,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:22" (3/4) ... [2024-02-02 09:36:23,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eba26bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:23, skipping insertion in model container [2024-02-02 09:36:23,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:23" (4/4) ... [2024-02-02 09:36:23,516 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-02-02 09:36:23,529 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:36:23,530 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-02-02 09:36:23,530 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:36:23,575 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-02 09:36:23,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 96 flow [2024-02-02 09:36:23,638 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-02-02 09:36:23,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:23,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-02-02 09:36:23,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 46 transitions, 96 flow [2024-02-02 09:36:23,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 45 transitions, 93 flow [2024-02-02 09:36:23,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:36:23,667 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;@5304da64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:36:23,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-02-02 09:36:23,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:36:23,670 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:36:23,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:23,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:23,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:36:23,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:23,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 7420, now seen corresponding path program 1 times [2024-02-02 09:36:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90240389] [2024-02-02 09:36:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90240389] [2024-02-02 09:36:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90240389] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:23,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:36:23,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061718358] [2024-02-02 09:36:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:23,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:36:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:23,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:36:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:36:23,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-02-02 09:36:23,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-02-02 09:36:23,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:23,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-02-02 09:36:23,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:24,066 INFO L124 PetriNetUnfolderBase]: 76/248 cut-off events. [2024-02-02 09:36:24,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 248 events. 76/248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1149 event pairs, 34 based on Foata normal form. 15/242 useless extension candidates. Maximal degree in co-relation 416. Up to 135 conditions per place. [2024-02-02 09:36:24,072 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-02-02 09:36:24,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 161 flow [2024-02-02 09:36:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:36:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:36:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-02 09:36:24,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2024-02-02 09:36:24,083 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 93 flow. Second operand 3 states and 102 transitions. [2024-02-02 09:36:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 161 flow [2024-02-02 09:36:24,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:36:24,090 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 102 flow [2024-02-02 09:36:24,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-02-02 09:36:24,096 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-02-02 09:36:24,096 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 102 flow [2024-02-02 09:36:24,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-02-02 09:36:24,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:24,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:36:24,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:36:24,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:24,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 221305705, now seen corresponding path program 1 times [2024-02-02 09:36:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882857318] [2024-02-02 09:36:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882857318] [2024-02-02 09:36:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882857318] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:24,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192880009] [2024-02-02 09:36:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:24,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:24,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 46 [2024-02-02 09:36:24,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-02-02 09:36:24,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:24,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 46 [2024-02-02 09:36:24,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:24,364 INFO L124 PetriNetUnfolderBase]: 49/214 cut-off events. [2024-02-02 09:36:24,365 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-02-02 09:36:24,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 214 events. 49/214 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 954 event pairs, 30 based on Foata normal form. 8/205 useless extension candidates. Maximal degree in co-relation 352. Up to 105 conditions per place. [2024-02-02 09:36:24,366 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 22 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-02-02 09:36:24,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 160 flow [2024-02-02 09:36:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-02-02 09:36:24,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7065217391304348 [2024-02-02 09:36:24,368 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 102 flow. Second operand 4 states and 130 transitions. [2024-02-02 09:36:24,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 160 flow [2024-02-02 09:36:24,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:24,370 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 98 flow [2024-02-02 09:36:24,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-02-02 09:36:24,371 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-02-02 09:36:24,371 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 98 flow [2024-02-02 09:36:24,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-02-02 09:36:24,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:24,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:24,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:36:24,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:24,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash 143696649, now seen corresponding path program 1 times [2024-02-02 09:36:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956017524] [2024-02-02 09:36:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:24,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956017524] [2024-02-02 09:36:24,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956017524] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:36:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507668311] [2024-02-02 09:36:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:24,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:24,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-02-02 09:36:24,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-02-02 09:36:24,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:24,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-02-02 09:36:24,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:24,673 INFO L124 PetriNetUnfolderBase]: 97/284 cut-off events. [2024-02-02 09:36:24,674 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-02-02 09:36:24,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 284 events. 97/284 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1326 event pairs, 27 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 537. Up to 135 conditions per place. [2024-02-02 09:36:24,676 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 36 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-02-02 09:36:24,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 200 flow [2024-02-02 09:36:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-02-02 09:36:24,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5489130434782609 [2024-02-02 09:36:24,677 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 98 flow. Second operand 4 states and 101 transitions. [2024-02-02 09:36:24,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 200 flow [2024-02-02 09:36:24,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:24,679 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 97 flow [2024-02-02 09:36:24,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-02-02 09:36:24,680 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-02-02 09:36:24,680 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 97 flow [2024-02-02 09:36:24,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-02-02 09:36:24,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:24,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:24,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:36:24,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:24,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 980981676, now seen corresponding path program 1 times [2024-02-02 09:36:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700192639] [2024-02-02 09:36:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:24,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-02-02 09:36:24,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:24,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700192639] [2024-02-02 09:36:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700192639] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77598650] [2024-02-02 09:36:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:24,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:24,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:24,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-02 09:36:24,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-02-02 09:36:24,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:24,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-02 09:36:24,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:24,809 INFO L124 PetriNetUnfolderBase]: 77/223 cut-off events. [2024-02-02 09:36:24,809 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-02 09:36:24,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 223 events. 77/223 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 900 event pairs, 7 based on Foata normal form. 24/243 useless extension candidates. Maximal degree in co-relation 424. Up to 90 conditions per place. [2024-02-02 09:36:24,810 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 27 selfloop transitions, 2 changer transitions 6/47 dead transitions. [2024-02-02 09:36:24,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 175 flow [2024-02-02 09:36:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-02-02 09:36:24,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271739130434783 [2024-02-02 09:36:24,812 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 97 flow. Second operand 4 states and 97 transitions. [2024-02-02 09:36:24,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 175 flow [2024-02-02 09:36:24,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 167 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:36:24,813 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 69 flow [2024-02-02 09:36:24,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=69, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2024-02-02 09:36:24,814 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2024-02-02 09:36:24,814 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 69 flow [2024-02-02 09:36:24,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-02-02 09:36:24,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:24,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:24,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:36:24,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:24,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1500324516, now seen corresponding path program 1 times [2024-02-02 09:36:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655668832] [2024-02-02 09:36:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655668832] [2024-02-02 09:36:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655668832] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973564525] [2024-02-02 09:36:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:24,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:24,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-02-02 09:36:24,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-02-02 09:36:24,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:24,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-02-02 09:36:24,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:24,965 INFO L124 PetriNetUnfolderBase]: 58/173 cut-off events. [2024-02-02 09:36:24,966 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-02 09:36:24,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 173 events. 58/173 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 18 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 311. Up to 77 conditions per place. [2024-02-02 09:36:24,980 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 19 selfloop transitions, 2 changer transitions 12/46 dead transitions. [2024-02-02 09:36:24,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 167 flow [2024-02-02 09:36:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:36:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:36:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-02-02 09:36:24,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-02-02 09:36:24,982 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 69 flow. Second operand 5 states and 135 transitions. [2024-02-02 09:36:24,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 167 flow [2024-02-02 09:36:24,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:24,983 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 76 flow [2024-02-02 09:36:24,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2024-02-02 09:36:24,984 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-02-02 09:36:24,984 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 76 flow [2024-02-02 09:36:24,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-02-02 09:36:24,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:24,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:24,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:36:24,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:24,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 59992006, now seen corresponding path program 1 times [2024-02-02 09:36:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972826531] [2024-02-02 09:36:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:25,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972826531] [2024-02-02 09:36:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972826531] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462792067] [2024-02-02 09:36:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:25,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:25,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:25,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 46 [2024-02-02 09:36:25,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-02-02 09:36:25,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:25,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 46 [2024-02-02 09:36:25,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:25,166 INFO L124 PetriNetUnfolderBase]: 13/87 cut-off events. [2024-02-02 09:36:25,166 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-02-02 09:36:25,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 87 events. 13/87 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 5 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 146. Up to 27 conditions per place. [2024-02-02 09:36:25,167 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 12 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2024-02-02 09:36:25,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 118 flow [2024-02-02 09:36:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-02-02 09:36:25,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7336956521739131 [2024-02-02 09:36:25,169 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 76 flow. Second operand 4 states and 135 transitions. [2024-02-02 09:36:25,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 118 flow [2024-02-02 09:36:25,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 110 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-02 09:36:25,170 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 78 flow [2024-02-02 09:36:25,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-02-02 09:36:25,170 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2024-02-02 09:36:25,171 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 78 flow [2024-02-02 09:36:25,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-02-02 09:36:25,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:25,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:25,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:36:25,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:25,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1405932426, now seen corresponding path program 2 times [2024-02-02 09:36:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:25,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226039977] [2024-02-02 09:36:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226039977] [2024-02-02 09:36:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226039977] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:25,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:36:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344127928] [2024-02-02 09:36:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:25,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:25,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:25,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 46 [2024-02-02 09:36:25,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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-02-02 09:36:25,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:25,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 46 [2024-02-02 09:36:25,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:25,333 INFO L124 PetriNetUnfolderBase]: 10/70 cut-off events. [2024-02-02 09:36:25,333 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-02-02 09:36:25,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 70 events. 10/70 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 5 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 120. Up to 20 conditions per place. [2024-02-02 09:36:25,334 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 12 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2024-02-02 09:36:25,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 120 flow [2024-02-02 09:36:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-02 09:36:25,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2024-02-02 09:36:25,335 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 78 flow. Second operand 4 states and 134 transitions. [2024-02-02 09:36:25,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 120 flow [2024-02-02 09:36:25,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:25,336 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 81 flow [2024-02-02 09:36:25,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-02-02 09:36:25,337 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2024-02-02 09:36:25,337 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 81 flow [2024-02-02 09:36:25,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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-02-02 09:36:25,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:25,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:25,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:36:25,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 16 more)] === [2024-02-02 09:36:25,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1640890603, now seen corresponding path program 1 times [2024-02-02 09:36:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914348507] [2024-02-02 09:36:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:25,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:36:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:25,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:36:25,378 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:36:25,379 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (18 of 19 remaining) [2024-02-02 09:36:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 19 remaining) [2024-02-02 09:36:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 19 remaining) [2024-02-02 09:36:25,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 19 remaining) [2024-02-02 09:36:25,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 19 remaining) [2024-02-02 09:36:25,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 19 remaining) [2024-02-02 09:36:25,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2024-02-02 09:36:25,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 19 remaining) [2024-02-02 09:36:25,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 19 remaining) [2024-02-02 09:36:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 19 remaining) [2024-02-02 09:36:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 19 remaining) [2024-02-02 09:36:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 19 remaining) [2024-02-02 09:36:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 19 remaining) [2024-02-02 09:36:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 19 remaining) [2024-02-02 09:36:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 19 remaining) [2024-02-02 09:36:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 19 remaining) [2024-02-02 09:36:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 19 remaining) [2024-02-02 09:36:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 19 remaining) [2024-02-02 09:36:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 19 remaining) [2024-02-02 09:36:25,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:36:25,384 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:25,388 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:36:25,388 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:36:25,410 INFO L503 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-02-02 09:36:25,410 INFO L504 ceAbstractionStarter]: WitnessConsidered=11 [2024-02-02 09:36:25,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:36:25 BasicIcfg [2024-02-02 09:36:25,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:36:25,411 INFO L158 Benchmark]: Toolchain (without parser) took 2995.77ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 111.1MB in the beginning and 138.8MB in the end (delta: -27.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-02-02 09:36:25,411 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:25,411 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory was 158.8MB in the beginning and 158.7MB in the end (delta: 117.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:25,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.09ms. Allocated memory is still 186.6MB. Free memory was 110.9MB in the beginning and 140.2MB in the end (delta: -29.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-02-02 09:36:25,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.82ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 138.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:25,412 INFO L158 Benchmark]: Boogie Preprocessor took 45.57ms. Allocated memory is still 186.6MB. Free memory was 138.1MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:25,412 INFO L158 Benchmark]: RCFGBuilder took 444.37ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 107.5MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-02-02 09:36:25,413 INFO L158 Benchmark]: TraceAbstraction took 1899.38ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 106.7MB in the beginning and 138.8MB in the end (delta: -32.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:25,414 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.14ms. Allocated memory is still 104.9MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory was 158.8MB in the beginning and 158.7MB in the end (delta: 117.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.09ms. Allocated memory is still 186.6MB. Free memory was 110.9MB in the beginning and 140.2MB in the end (delta: -29.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.82ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 138.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.57ms. Allocated memory is still 186.6MB. Free memory was 138.1MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.37ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 107.5MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1899.38ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 106.7MB in the beginning and 138.8MB in the end (delta: -32.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L681] 0 int g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L693] 0 pthread_t id; VAL [A={3:0}, D={4:0}, g=0, id={5:0}] [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] [L694] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, D={4:0}, arg={0:0}, g=0, id={5:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] [L687] 1 g = 17 VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] [L698] CALL 0 __VERIFIER_assert(g == 0) [L19] COND TRUE 0 !(cond) VAL [A={3:0}, D={4:0}, \old(cond)=0, arg={0:0}, arg={0:0}, cond=0, g=17] [L19] 0 reach_error() VAL [A={3:0}, D={4:0}, \old(cond)=0, arg={0:0}, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 69 locations, 19 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: 1.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 32 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=1, InterpolantAutomatonStates: 28, 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.6s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 405 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-02-02 09:36:25,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE