./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:16:51,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:16:51,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:16:51,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:16:51,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:16:51,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:16:51,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:16:51,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:16:51,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:16:51,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:16:51,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:16:51,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:16:51,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:16:51,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:16:51,634 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:16:51,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:16:51,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:16:51,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:16:51,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:16:51,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:16:51,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:16:51,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:16:51,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:16:51,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:16:51,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:16:51,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:16:51,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:16:51,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:16:51,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:16:51,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:16:51,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:16:51,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:16:51,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:51,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:16:51,647 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:16:51,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:16:51,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:16:51,648 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-01-27 16:16:51,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:16:51,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:16:51,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:16:51,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:16:51,912 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:16:51,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-01-27 16:16:53,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:16:53,597 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:16:53,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-01-27 16:16:53,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d698b408b/dc0013b5e9a64f2b80350eb25be003a7/FLAG540f7e747 [2024-01-27 16:16:53,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d698b408b/dc0013b5e9a64f2b80350eb25be003a7 [2024-01-27 16:16:53,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:16:53,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:16:53,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:53,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:16:53,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:16:53,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4e874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53, skipping insertion in model container [2024-01-27 16:16:53,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:16:54,090 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[186287,186300] [2024-01-27 16:16:54,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:54,154 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:16:54,199 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[186287,186300] [2024-01-27 16:16:54,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:54,254 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:16:54,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54 WrapperNode [2024-01-27 16:16:54,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:54,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:54,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:16:54,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:16:54,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,338 INFO L138 Inliner]: procedures = 246, calls = 47, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2024-01-27 16:16:54,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:54,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:16:54,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:16:54,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:16:54,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,378 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [2, 3, 3, 2, 11]. 52 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0, 0]. The 10 writes are split as follows [0, 1, 1, 2, 6]. [2024-01-27 16:16:54,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:16:54,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:16:54,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:16:54,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:16:54,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:16:54,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:16:54,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:16:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-01-27 16:16:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-01-27 16:16:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:16:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:16:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:16:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:16:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:16:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:16:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:16:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:16:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:16:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-27 16:16:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-27 16:16:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-27 16:16:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-27 16:16:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-01-27 16:16:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:16:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:16:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:16:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:16:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:16:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:16:54,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:16:54,568 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:16:54,877 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:16:54,879 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:16:55,048 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:16:55,048 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:16:55,210 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:16:55,211 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:16:55,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:55 BoogieIcfgContainer [2024-01-27 16:16:55,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:16:55,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:16:55,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:16:55,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:16:55,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:16:53" (1/3) ... [2024-01-27 16:16:55,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae464eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:55, skipping insertion in model container [2024-01-27 16:16:55,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54" (2/3) ... [2024-01-27 16:16:55,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae464eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:55, skipping insertion in model container [2024-01-27 16:16:55,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:55" (3/3) ... [2024-01-27 16:16:55,222 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-01-27 16:16:55,230 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:16:55,240 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:16:55,240 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-27 16:16:55,240 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:16:55,309 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:16:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2024-01-27 16:16:55,382 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2024-01-27 16:16:55,382 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:16:55,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 63 events. 8/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2024-01-27 16:16:55,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2024-01-27 16:16:55,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2024-01-27 16:16:55,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:16:55,409 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=true, 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;@2fdac0d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:16:55,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:16:55,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:16:55,419 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-01-27 16:16:55,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:16:55,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:55,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:55,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:16:55,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash 616145943, now seen corresponding path program 1 times [2024-01-27 16:16:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:55,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88042119] [2024-01-27 16:16:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:55,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:55,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:55,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88042119] [2024-01-27 16:16:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88042119] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:55,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:55,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:16:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477654181] [2024-01-27 16:16:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:56,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:56,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:16:56,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:56,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:56,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:16:56,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:56,433 INFO L124 PetriNetUnfolderBase]: 466/820 cut-off events. [2024-01-27 16:16:56,433 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-01-27 16:16:56,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 820 events. 466/820 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3438 event pairs, 345 based on Foata normal form. 2/819 useless extension candidates. Maximal degree in co-relation 1541. Up to 600 conditions per place. [2024-01-27 16:16:56,447 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-01-27 16:16:56,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2024-01-27 16:16:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-01-27 16:16:56,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-01-27 16:16:56,464 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2024-01-27 16:16:56,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2024-01-27 16:16:56,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:16:56,474 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2024-01-27 16:16:56,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2024-01-27 16:16:56,481 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2024-01-27 16:16:56,482 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2024-01-27 16:16:56,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:56,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:56,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:56,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:16:56,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:16:56,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -589179464, now seen corresponding path program 1 times [2024-01-27 16:16:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070425679] [2024-01-27 16:16:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070425679] [2024-01-27 16:16:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070425679] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352012761] [2024-01-27 16:16:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:56,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:56,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:56,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:56,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:16:56,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:56,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:56,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:16:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:57,059 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-01-27 16:16:57,060 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-01-27 16:16:57,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1095 events. 602/1095 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5278 event pairs, 289 based on Foata normal form. 69/1163 useless extension candidates. Maximal degree in co-relation 819. Up to 574 conditions per place. [2024-01-27 16:16:57,069 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2024-01-27 16:16:57,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2024-01-27 16:16:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-01-27 16:16:57,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-01-27 16:16:57,074 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2024-01-27 16:16:57,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2024-01-27 16:16:57,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:57,081 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2024-01-27 16:16:57,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-01-27 16:16:57,082 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-01-27 16:16:57,082 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2024-01-27 16:16:57,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:57,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:57,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:16:57,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:16:57,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1691287494, now seen corresponding path program 1 times [2024-01-27 16:16:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:57,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200103481] [2024-01-27 16:16:57,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:57,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200103481] [2024-01-27 16:16:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200103481] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:57,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:57,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513400318] [2024-01-27 16:16:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:57,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:57,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-01-27 16:16:57,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:57,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:57,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-01-27 16:16:57,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:57,356 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2024-01-27 16:16:57,356 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-01-27 16:16:57,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 404 events. 225/404 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1498 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 909. Up to 217 conditions per place. [2024-01-27 16:16:57,358 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-01-27 16:16:57,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2024-01-27 16:16:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-01-27 16:16:57,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-01-27 16:16:57,360 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2024-01-27 16:16:57,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2024-01-27 16:16:57,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:16:57,362 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2024-01-27 16:16:57,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-01-27 16:16:57,363 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2024-01-27 16:16:57,363 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2024-01-27 16:16:57,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:57,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:57,363 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] [2024-01-27 16:16:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:16:57,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:16:57,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1565858277, now seen corresponding path program 1 times [2024-01-27 16:16:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634847816] [2024-01-27 16:16:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634847816] [2024-01-27 16:16:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634847816] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:58,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:58,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-27 16:16:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066919358] [2024-01-27 16:16:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:58,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:16:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:16:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:16:58,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:16:58,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 74 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:58,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:58,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:16:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:59,456 INFO L124 PetriNetUnfolderBase]: 483/882 cut-off events. [2024-01-27 16:16:59,457 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2024-01-27 16:16:59,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 882 events. 483/882 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4128 event pairs, 17 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 349. Up to 233 conditions per place. [2024-01-27 16:16:59,462 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 95 selfloop transitions, 32 changer transitions 0/129 dead transitions. [2024-01-27 16:16:59,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 129 transitions, 615 flow [2024-01-27 16:16:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 16:16:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 16:16:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 273 transitions. [2024-01-27 16:16:59,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30333333333333334 [2024-01-27 16:16:59,467 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 18 states and 273 transitions. [2024-01-27 16:16:59,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 129 transitions, 615 flow [2024-01-27 16:16:59,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 129 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:59,472 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 308 flow [2024-01-27 16:16:59,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=308, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-01-27 16:16:59,474 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-01-27 16:16:59,474 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 308 flow [2024-01-27 16:16:59,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:16:59,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:59,475 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] [2024-01-27 16:16:59,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:16:59,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:16:59,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1562877219, now seen corresponding path program 2 times [2024-01-27 16:16:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:59,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479090575] [2024-01-27 16:16:59,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:59,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479090575] [2024-01-27 16:17:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479090575] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:00,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-27 16:17:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648221495] [2024-01-27 16:17:00,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:00,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:17:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:17:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:17:00,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:00,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 308 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:00,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:00,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:00,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:01,172 INFO L124 PetriNetUnfolderBase]: 696/1283 cut-off events. [2024-01-27 16:17:01,172 INFO L125 PetriNetUnfolderBase]: For 1813/1813 co-relation queries the response was YES. [2024-01-27 16:17:01,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 1283 events. 696/1283 cut-off events. For 1813/1813 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6584 event pairs, 60 based on Foata normal form. 1/1284 useless extension candidates. Maximal degree in co-relation 3994. Up to 471 conditions per place. [2024-01-27 16:17:01,220 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 94 selfloop transitions, 37 changer transitions 0/133 dead transitions. [2024-01-27 16:17:01,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 133 transitions, 906 flow [2024-01-27 16:17:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-27 16:17:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-01-27 16:17:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2024-01-27 16:17:01,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2024-01-27 16:17:01,223 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 308 flow. Second operand 14 states and 207 transitions. [2024-01-27 16:17:01,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 133 transitions, 906 flow [2024-01-27 16:17:01,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 133 transitions, 892 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-27 16:17:01,236 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 527 flow [2024-01-27 16:17:01,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2024-01-27 16:17:01,239 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-01-27 16:17:01,239 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 527 flow [2024-01-27 16:17:01,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:01,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:01,240 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] [2024-01-27 16:17:01,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:17:01,241 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:01,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -137263557, now seen corresponding path program 3 times [2024-01-27 16:17:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314492624] [2024-01-27 16:17:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:01,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314492624] [2024-01-27 16:17:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314492624] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:01,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:17:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211725668] [2024-01-27 16:17:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:01,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:17:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:01,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:17:01,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:17:01,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:01,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:01,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:01,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:01,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:02,406 INFO L124 PetriNetUnfolderBase]: 834/1583 cut-off events. [2024-01-27 16:17:02,407 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2024-01-27 16:17:02,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5239 conditions, 1583 events. 834/1583 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8892 event pairs, 50 based on Foata normal form. 1/1584 useless extension candidates. Maximal degree in co-relation 5179. Up to 525 conditions per place. [2024-01-27 16:17:02,418 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 90 selfloop transitions, 52 changer transitions 0/144 dead transitions. [2024-01-27 16:17:02,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 1192 flow [2024-01-27 16:17:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:17:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:17:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-01-27 16:17:02,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31272727272727274 [2024-01-27 16:17:02,420 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 527 flow. Second operand 11 states and 172 transitions. [2024-01-27 16:17:02,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 1192 flow [2024-01-27 16:17:02,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 1160 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-01-27 16:17:02,436 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 844 flow [2024-01-27 16:17:02,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=844, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2024-01-27 16:17:02,439 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-01-27 16:17:02,439 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 844 flow [2024-01-27 16:17:02,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:02,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:02,439 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] [2024-01-27 16:17:02,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:17:02,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:02,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -625915235, now seen corresponding path program 4 times [2024-01-27 16:17:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:02,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805102197] [2024-01-27 16:17:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:03,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:03,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805102197] [2024-01-27 16:17:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805102197] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:03,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-27 16:17:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247282094] [2024-01-27 16:17:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:03,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:17:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:17:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:17:03,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:03,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 844 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:03,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:03,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:04,391 INFO L124 PetriNetUnfolderBase]: 848/1621 cut-off events. [2024-01-27 16:17:04,391 INFO L125 PetriNetUnfolderBase]: For 5114/5114 co-relation queries the response was YES. [2024-01-27 16:17:04,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 1621 events. 848/1621 cut-off events. For 5114/5114 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9147 event pairs, 143 based on Foata normal form. 1/1622 useless extension candidates. Maximal degree in co-relation 5821. Up to 385 conditions per place. [2024-01-27 16:17:04,406 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 125 selfloop transitions, 63 changer transitions 0/189 dead transitions. [2024-01-27 16:17:04,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 189 transitions, 1755 flow [2024-01-27 16:17:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 16:17:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 16:17:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 273 transitions. [2024-01-27 16:17:04,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30333333333333334 [2024-01-27 16:17:04,409 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 844 flow. Second operand 18 states and 273 transitions. [2024-01-27 16:17:04,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 189 transitions, 1755 flow [2024-01-27 16:17:04,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 189 transitions, 1667 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-01-27 16:17:04,439 INFO L231 Difference]: Finished difference. Result has 105 places, 113 transitions, 1175 flow [2024-01-27 16:17:04,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1175, PETRI_PLACES=105, PETRI_TRANSITIONS=113} [2024-01-27 16:17:04,440 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places. [2024-01-27 16:17:04,440 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 113 transitions, 1175 flow [2024-01-27 16:17:04,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:04,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:04,441 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] [2024-01-27 16:17:04,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:17:04,441 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:04,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -884029848, now seen corresponding path program 1 times [2024-01-27 16:17:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893845929] [2024-01-27 16:17:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:05,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:05,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893845929] [2024-01-27 16:17:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893845929] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:05,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-27 16:17:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198542313] [2024-01-27 16:17:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:05,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 16:17:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 16:17:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-01-27 16:17:05,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:05,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 113 transitions, 1175 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:05,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:05,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:05,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:06,465 INFO L124 PetriNetUnfolderBase]: 1036/1969 cut-off events. [2024-01-27 16:17:06,466 INFO L125 PetriNetUnfolderBase]: For 9470/9470 co-relation queries the response was YES. [2024-01-27 16:17:06,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7919 conditions, 1969 events. 1036/1969 cut-off events. For 9470/9470 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11616 event pairs, 362 based on Foata normal form. 1/1970 useless extension candidates. Maximal degree in co-relation 7669. Up to 1432 conditions per place. [2024-01-27 16:17:06,485 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 102 selfloop transitions, 69 changer transitions 45/217 dead transitions. [2024-01-27 16:17:06,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 217 transitions, 2496 flow [2024-01-27 16:17:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 16:17:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 16:17:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2024-01-27 16:17:06,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-01-27 16:17:06,487 INFO L175 Difference]: Start difference. First operand has 105 places, 113 transitions, 1175 flow. Second operand 18 states and 250 transitions. [2024-01-27 16:17:06,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 217 transitions, 2496 flow [2024-01-27 16:17:06,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 217 transitions, 2386 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-01-27 16:17:06,534 INFO L231 Difference]: Finished difference. Result has 127 places, 149 transitions, 1838 flow [2024-01-27 16:17:06,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1838, PETRI_PLACES=127, PETRI_TRANSITIONS=149} [2024-01-27 16:17:06,537 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 82 predicate places. [2024-01-27 16:17:06,537 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 149 transitions, 1838 flow [2024-01-27 16:17:06,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:06,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:06,538 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] [2024-01-27 16:17:06,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:17:06,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:06,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash 401358254, now seen corresponding path program 2 times [2024-01-27 16:17:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059532772] [2024-01-27 16:17:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:07,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059532772] [2024-01-27 16:17:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059532772] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-27 16:17:07,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736262117] [2024-01-27 16:17:07,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:07,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 16:17:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:07,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 16:17:07,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-01-27 16:17:07,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:07,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 149 transitions, 1838 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:07,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:07,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:07,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:08,657 INFO L124 PetriNetUnfolderBase]: 1167/2248 cut-off events. [2024-01-27 16:17:08,657 INFO L125 PetriNetUnfolderBase]: For 14082/14082 co-relation queries the response was YES. [2024-01-27 16:17:08,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10256 conditions, 2248 events. 1167/2248 cut-off events. For 14082/14082 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13980 event pairs, 451 based on Foata normal form. 2/2250 useless extension candidates. Maximal degree in co-relation 10172. Up to 1636 conditions per place. [2024-01-27 16:17:08,680 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 148 selfloop transitions, 81 changer transitions 33/263 dead transitions. [2024-01-27 16:17:08,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 263 transitions, 3429 flow [2024-01-27 16:17:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 16:17:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 16:17:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2024-01-27 16:17:08,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2024-01-27 16:17:08,684 INFO L175 Difference]: Start difference. First operand has 127 places, 149 transitions, 1838 flow. Second operand 19 states and 277 transitions. [2024-01-27 16:17:08,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 263 transitions, 3429 flow [2024-01-27 16:17:08,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 263 transitions, 3241 flow, removed 80 selfloop flow, removed 9 redundant places. [2024-01-27 16:17:08,759 INFO L231 Difference]: Finished difference. Result has 136 places, 183 transitions, 2437 flow [2024-01-27 16:17:08,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2437, PETRI_PLACES=136, PETRI_TRANSITIONS=183} [2024-01-27 16:17:08,760 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 91 predicate places. [2024-01-27 16:17:08,760 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 183 transitions, 2437 flow [2024-01-27 16:17:08,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:08,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:08,761 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] [2024-01-27 16:17:08,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:17:08,761 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:08,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1046338870, now seen corresponding path program 3 times [2024-01-27 16:17:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22446360] [2024-01-27 16:17:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22446360] [2024-01-27 16:17:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22446360] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:09,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:09,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-27 16:17:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108597602] [2024-01-27 16:17:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:09,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 16:17:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:09,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 16:17:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-01-27 16:17:09,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:09,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 183 transitions, 2437 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:09,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:09,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:09,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:11,029 INFO L124 PetriNetUnfolderBase]: 1287/2518 cut-off events. [2024-01-27 16:17:11,030 INFO L125 PetriNetUnfolderBase]: For 15980/15980 co-relation queries the response was YES. [2024-01-27 16:17:11,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11595 conditions, 2518 events. 1287/2518 cut-off events. For 15980/15980 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16201 event pairs, 450 based on Foata normal form. 2/2520 useless extension candidates. Maximal degree in co-relation 11500. Up to 1570 conditions per place. [2024-01-27 16:17:11,063 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 164 selfloop transitions, 105 changer transitions 35/305 dead transitions. [2024-01-27 16:17:11,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 305 transitions, 4070 flow [2024-01-27 16:17:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-27 16:17:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-27 16:17:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2024-01-27 16:17:11,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2024-01-27 16:17:11,066 INFO L175 Difference]: Start difference. First operand has 136 places, 183 transitions, 2437 flow. Second operand 23 states and 325 transitions. [2024-01-27 16:17:11,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 305 transitions, 4070 flow [2024-01-27 16:17:11,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 305 transitions, 3875 flow, removed 84 selfloop flow, removed 5 redundant places. [2024-01-27 16:17:11,152 INFO L231 Difference]: Finished difference. Result has 162 places, 212 transitions, 3052 flow [2024-01-27 16:17:11,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3052, PETRI_PLACES=162, PETRI_TRANSITIONS=212} [2024-01-27 16:17:11,154 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 117 predicate places. [2024-01-27 16:17:11,154 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 212 transitions, 3052 flow [2024-01-27 16:17:11,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:11,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:11,155 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] [2024-01-27 16:17:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:17:11,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:11,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1137430188, now seen corresponding path program 4 times [2024-01-27 16:17:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799154044] [2024-01-27 16:17:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799154044] [2024-01-27 16:17:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799154044] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-27 16:17:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349065055] [2024-01-27 16:17:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:12,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 16:17:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 16:17:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-01-27 16:17:12,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-01-27 16:17:12,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 212 transitions, 3052 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:12,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:12,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-01-27 16:17:12,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:13,425 INFO L124 PetriNetUnfolderBase]: 1317/2644 cut-off events. [2024-01-27 16:17:13,425 INFO L125 PetriNetUnfolderBase]: For 18949/18949 co-relation queries the response was YES. [2024-01-27 16:17:13,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12648 conditions, 2644 events. 1317/2644 cut-off events. For 18949/18949 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17612 event pairs, 574 based on Foata normal form. 2/2646 useless extension candidates. Maximal degree in co-relation 12542. Up to 1882 conditions per place. [2024-01-27 16:17:13,460 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 193 selfloop transitions, 97 changer transitions 31/322 dead transitions. [2024-01-27 16:17:13,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 322 transitions, 4627 flow [2024-01-27 16:17:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-27 16:17:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-01-27 16:17:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 308 transitions. [2024-01-27 16:17:13,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2024-01-27 16:17:13,463 INFO L175 Difference]: Start difference. First operand has 162 places, 212 transitions, 3052 flow. Second operand 21 states and 308 transitions. [2024-01-27 16:17:13,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 322 transitions, 4627 flow [2024-01-27 16:17:13,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 322 transitions, 4532 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-01-27 16:17:13,585 INFO L231 Difference]: Finished difference. Result has 181 places, 233 transitions, 3552 flow [2024-01-27 16:17:13,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3552, PETRI_PLACES=181, PETRI_TRANSITIONS=233} [2024-01-27 16:17:13,586 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 136 predicate places. [2024-01-27 16:17:13,586 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 233 transitions, 3552 flow [2024-01-27 16:17:13,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:13,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:13,588 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] [2024-01-27 16:17:13,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:17:13,588 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 16:17:13,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2087778408, now seen corresponding path program 5 times [2024-01-27 16:17:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:13,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382691631] [2024-01-27 16:17:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:17:13,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:17:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:17:13,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:17:13,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:17:13,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:17:13,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:17:13,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-01-27 16:17:13,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-01-27 16:17:13,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:17:13,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-01-27 16:17:13,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:17:13,693 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1] [2024-01-27 16:17:13,698 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:17:13,698 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:17:13,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:17:13 BasicIcfg [2024-01-27 16:17:13,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:17:13,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:17:13,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:17:13,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:17:13,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:55" (3/4) ... [2024-01-27 16:17:13,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:17:13,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:17:13,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:17:13,841 INFO L158 Benchmark]: Toolchain (without parser) took 20179.22ms. Allocated memory was 130.0MB in the beginning and 616.6MB in the end (delta: 486.5MB). Free memory was 55.3MB in the beginning and 275.7MB in the end (delta: -220.4MB). Peak memory consumption was 267.4MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,841 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:17:13,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.91ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 55.1MB in the beginning and 110.9MB in the end (delta: -55.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.92ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 108.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,842 INFO L158 Benchmark]: Boogie Preprocessor took 92.66ms. Allocated memory is still 172.0MB. Free memory was 108.3MB in the beginning and 104.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,843 INFO L158 Benchmark]: RCFGBuilder took 779.10ms. Allocated memory is still 172.0MB. Free memory was 104.1MB in the beginning and 122.0MB in the end (delta: -17.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,843 INFO L158 Benchmark]: TraceAbstraction took 18553.84ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 121.0MB in the beginning and 284.0MB in the end (delta: -163.1MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,843 INFO L158 Benchmark]: Witness Printer took 73.08ms. Allocated memory is still 616.6MB. Free memory was 284.0MB in the beginning and 275.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:17:13,845 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.91ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 55.1MB in the beginning and 110.9MB in the end (delta: -55.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.92ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 108.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.66ms. Allocated memory is still 172.0MB. Free memory was 108.3MB in the beginning and 104.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 779.10ms. Allocated memory is still 172.0MB. Free memory was 104.1MB in the beginning and 122.0MB in the end (delta: -17.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18553.84ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 121.0MB in the beginning and 284.0MB in the end (delta: -163.1MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. * Witness Printer took 73.08ms. Allocated memory is still 616.6MB. Free memory was 284.0MB in the beginning and 275.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L3932] 0 return 0; VAL [\result=0, arg={6:24}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3917] 1 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; [L3939] 0 \read(t1) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L3914] 2 data->shared.b = lb + 1 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3917] 2 return 0; [L3940] 0 \read(t2) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=1, lb=0, t1={3:0}, t2={4:0}] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] [L3887] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3930]: 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: 3931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 52 locations, 6 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: 18.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1144 mSDsluCounter, 670 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 604 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4594 IncrementalHoareTripleChecker+Invalid, 4742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 66 mSDtfsCounter, 4594 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3552occurred in iteration=11, InterpolantAutomatonStates: 153, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:17:13,887 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