./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 7724a2de 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-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:30:17,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:30:17,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:30:17,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:30:17,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:30:17,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:30:17,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:30:17,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:30:17,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:30:17,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:30:17,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:30:17,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:30:17,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:30:17,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:30:17,478 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:30:17,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:30:17,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:30:17,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:30:17,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:30:17,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:30:17,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:30:17,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:30:17,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:30:17,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:30:17,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:30:17,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:30:17,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:30:17,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:30:17,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:30:17,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:30:17,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:30:17,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:30:17,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:30:17,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:30:17,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:30:17,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:30:17,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:30:17,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:30:17,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:30:17,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:30:17,484 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:30:17,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:30:17,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:30:17,484 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-06-27 17:30:17,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:30:17,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:30:17,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:30:17,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:30:17,734 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:30:17,735 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-06-27 17:30:18,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:30:19,108 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:30:19,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-06-27 17:30:19,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90934c1dd/e1903765379944dc985f4a61459a12a1/FLAGb78e87518 [2024-06-27 17:30:19,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90934c1dd/e1903765379944dc985f4a61459a12a1 [2024-06-27 17:30:19,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:30:19,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:30:19,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:30:19,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:30:19,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:30:19,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4d6417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19, skipping insertion in model container [2024-06-27 17:30:19,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:30:19,535 WARN L247 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-06-27 17:30:19,588 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:30:19,596 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:30:19,641 WARN L247 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-06-27 17:30:19,654 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:30:19,698 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:30:19,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19 WrapperNode [2024-06-27 17:30:19,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:30:19,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:30:19,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:30:19,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:30:19,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,761 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-06-27 17:30:19,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:30:19,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:30:19,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:30:19,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:30:19,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,802 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 2, 11]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-06-27 17:30:19,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:30:19,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:30:19,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:30:19,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:30:19,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (1/1) ... [2024-06-27 17:30:19,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:30:19,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:30:19,896 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-06-27 17:30:19,903 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-06-27 17:30:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-06-27 17:30:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-06-27 17:30:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:30:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:30:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:30:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:30:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:30:19,936 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:30:20,131 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:30:20,133 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:30:20,307 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:30:20,308 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:30:20,504 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:30:20,504 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:30:20,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:20 BoogieIcfgContainer [2024-06-27 17:30:20,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:30:20,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:30:20,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:30:20,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:30:20,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:30:19" (1/3) ... [2024-06-27 17:30:20,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cd218b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:30:20, skipping insertion in model container [2024-06-27 17:30:20,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:19" (2/3) ... [2024-06-27 17:30:20,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cd218b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:30:20, skipping insertion in model container [2024-06-27 17:30:20,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:20" (3/3) ... [2024-06-27 17:30:20,526 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-06-27 17:30:20,533 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:30:20,540 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:30:20,540 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 17:30:20,556 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:30:20,595 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:30:20,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2024-06-27 17:30:20,646 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2024-06-27 17:30:20,646 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:30:20,650 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-06-27 17:30:20,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2024-06-27 17:30:20,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2024-06-27 17:30:20,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:30:20,675 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;@611dbc6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:30:20,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 17:30:20,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:30:20,683 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-06-27 17:30:20,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:30:20,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:20,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:20,685 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-06-27 17:30:20,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1544696618, now seen corresponding path program 1 times [2024-06-27 17:30:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516259031] [2024-06-27 17:30:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516259031] [2024-06-27 17:30:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516259031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:21,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:30:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369112403] [2024-06-27 17:30:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:21,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:30:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:30:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:30:21,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:21,267 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-06-27 17:30:21,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:21,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:21,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:21,464 INFO L124 PetriNetUnfolderBase]: 466/820 cut-off events. [2024-06-27 17:30:21,465 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 17:30:21,467 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 3463 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-06-27 17:30:21,471 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-06-27 17:30:21,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2024-06-27 17:30:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:30:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:30:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-27 17:30:21,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-27 17:30:21,482 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2024-06-27 17:30:21,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2024-06-27 17:30:21,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:30:21,486 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2024-06-27 17:30:21,488 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-06-27 17:30:21,490 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2024-06-27 17:30:21,490 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2024-06-27 17:30:21,491 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-06-27 17:30:21,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:21,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:21,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:30:21,491 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-06-27 17:30:21,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1605291128, now seen corresponding path program 1 times [2024-06-27 17:30:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879469019] [2024-06-27 17:30:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:21,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879469019] [2024-06-27 17:30:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879469019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:21,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380681392] [2024-06-27 17:30:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:21,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:21,610 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-06-27 17:30:21,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:21,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:21,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:21,776 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-06-27 17:30:21,776 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-06-27 17:30:21,778 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 5279 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-06-27 17:30:21,781 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2024-06-27 17:30:21,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2024-06-27 17:30:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:30:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:30:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-06-27 17:30:21,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:30:21,783 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2024-06-27 17:30:21,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2024-06-27 17:30:21,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:30:21,785 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2024-06-27 17:30:21,785 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-06-27 17:30:21,786 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-06-27 17:30:21,786 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2024-06-27 17:30:21,786 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-06-27 17:30:21,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:21,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:30:21,787 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-06-27 17:30:21,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1671475294, now seen corresponding path program 1 times [2024-06-27 17:30:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:21,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770754529] [2024-06-27 17:30:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770754529] [2024-06-27 17:30:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770754529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162314502] [2024-06-27 17:30:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:21,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:21,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 17:30:21,853 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-06-27 17:30:21,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:21,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 17:30:21,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:21,947 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2024-06-27 17:30:21,948 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-06-27 17:30:21,948 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 1493 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-06-27 17:30:21,950 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-06-27 17:30:21,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2024-06-27 17:30:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:30:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:30:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-06-27 17:30:21,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 17:30:21,951 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2024-06-27 17:30:21,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2024-06-27 17:30:21,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:30:21,953 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2024-06-27 17:30:21,953 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-06-27 17:30:21,954 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2024-06-27 17:30:21,954 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2024-06-27 17:30:21,954 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-06-27 17:30:21,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:21,954 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-06-27 17:30:21,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:30:21,955 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-06-27 17:30:21,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -897843709, now seen corresponding path program 1 times [2024-06-27 17:30:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158938819] [2024-06-27 17:30:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:22,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158938819] [2024-06-27 17:30:22,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158938819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:22,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:22,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 17:30:22,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597843407] [2024-06-27 17:30:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:22,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:30:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:30:22,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 17:30:22,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:22,760 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-06-27 17:30:22,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:22,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:22,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:23,252 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2024-06-27 17:30:23,252 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-06-27 17:30:23,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 718 events. 401/718 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3167 event pairs, 5 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 327. Up to 221 conditions per place. [2024-06-27 17:30:23,256 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-06-27 17:30:23,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 485 flow [2024-06-27 17:30:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 17:30:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 17:30:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2024-06-27 17:30:23,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2024-06-27 17:30:23,258 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 13 states and 205 transitions. [2024-06-27 17:30:23,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 485 flow [2024-06-27 17:30:23,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:30:23,260 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 186 flow [2024-06-27 17:30:23,260 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-27 17:30:23,261 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-27 17:30:23,261 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 186 flow [2024-06-27 17:30:23,261 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-06-27 17:30:23,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:23,261 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-06-27 17:30:23,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:30:23,262 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-06-27 17:30:23,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1109055311, now seen corresponding path program 2 times [2024-06-27 17:30:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755573142] [2024-06-27 17:30:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755573142] [2024-06-27 17:30:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755573142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:30:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686928004] [2024-06-27 17:30:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:23,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:30:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:30:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:30:23,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:23,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 186 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-06-27 17:30:23,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:23,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:23,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:24,021 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2024-06-27 17:30:24,021 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2024-06-27 17:30:24,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 870 events. 469/870 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4116 event pairs, 18 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 2405. Up to 302 conditions per place. [2024-06-27 17:30:24,026 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 25 changer transitions 0/102 dead transitions. [2024-06-27 17:30:24,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 637 flow [2024-06-27 17:30:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 17:30:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 17:30:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-06-27 17:30:24,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2024-06-27 17:30:24,028 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 186 flow. Second operand 11 states and 169 transitions. [2024-06-27 17:30:24,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 637 flow [2024-06-27 17:30:24,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:30:24,031 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 348 flow [2024-06-27 17:30:24,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=348, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-06-27 17:30:24,032 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-06-27 17:30:24,032 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 348 flow [2024-06-27 17:30:24,032 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-06-27 17:30:24,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:24,033 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-06-27 17:30:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:30:24,033 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-06-27 17:30:24,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 620403633, now seen corresponding path program 3 times [2024-06-27 17:30:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597256105] [2024-06-27 17:30:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597256105] [2024-06-27 17:30:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597256105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 17:30:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637599950] [2024-06-27 17:30:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:30:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:30:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 17:30:24,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:24,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 348 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-06-27 17:30:24,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:24,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:24,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:25,339 INFO L124 PetriNetUnfolderBase]: 722/1373 cut-off events. [2024-06-27 17:30:25,339 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-06-27 17:30:25,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 1373 events. 722/1373 cut-off events. For 2425/2425 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7323 event pairs, 68 based on Foata normal form. 2/1375 useless extension candidates. Maximal degree in co-relation 4245. Up to 325 conditions per place. [2024-06-27 17:30:25,347 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 97 selfloop transitions, 58 changer transitions 0/157 dead transitions. [2024-06-27 17:30:25,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1190 flow [2024-06-27 17:30:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:30:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:30:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 254 transitions. [2024-06-27 17:30:25,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2988235294117647 [2024-06-27 17:30:25,349 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 348 flow. Second operand 17 states and 254 transitions. [2024-06-27 17:30:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1190 flow [2024-06-27 17:30:25,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 157 transitions, 1157 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 17:30:25,360 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 842 flow [2024-06-27 17:30:25,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=842, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2024-06-27 17:30:25,361 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2024-06-27 17:30:25,361 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 842 flow [2024-06-27 17:30:25,361 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-06-27 17:30:25,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:25,361 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-06-27 17:30:25,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:30:25,362 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-06-27 17:30:25,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash -316558351, now seen corresponding path program 4 times [2024-06-27 17:30:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:25,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075143528] [2024-06-27 17:30:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:25,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:25,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075143528] [2024-06-27 17:30:25,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075143528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:25,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:25,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 17:30:25,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919195564] [2024-06-27 17:30:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:25,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:30:25,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:30:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 17:30:25,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:25,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 842 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-06-27 17:30:25,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:25,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:25,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:26,438 INFO L124 PetriNetUnfolderBase]: 722/1371 cut-off events. [2024-06-27 17:30:26,438 INFO L125 PetriNetUnfolderBase]: For 4558/4558 co-relation queries the response was YES. [2024-06-27 17:30:26,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5034 conditions, 1371 events. 722/1371 cut-off events. For 4558/4558 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7346 event pairs, 121 based on Foata normal form. 1/1372 useless extension candidates. Maximal degree in co-relation 4964. Up to 325 conditions per place. [2024-06-27 17:30:26,448 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 110 selfloop transitions, 52 changer transitions 0/163 dead transitions. [2024-06-27 17:30:26,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 163 transitions, 1533 flow [2024-06-27 17:30:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 17:30:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 17:30:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2024-06-27 17:30:26,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2024-06-27 17:30:26,451 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 842 flow. Second operand 15 states and 229 transitions. [2024-06-27 17:30:26,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 163 transitions, 1533 flow [2024-06-27 17:30:26,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 163 transitions, 1439 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-27 17:30:26,475 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 988 flow [2024-06-27 17:30:26,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=988, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2024-06-27 17:30:26,477 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-06-27 17:30:26,477 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 988 flow [2024-06-27 17:30:26,478 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-06-27 17:30:26,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:26,478 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-06-27 17:30:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:30:26,478 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-06-27 17:30:26,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1930621198, now seen corresponding path program 1 times [2024-06-27 17:30:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869363960] [2024-06-27 17:30:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869363960] [2024-06-27 17:30:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869363960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:27,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 17:30:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468494401] [2024-06-27 17:30:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:27,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:30:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:30:27,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:30:27,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:27,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 988 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-06-27 17:30:27,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:27,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:27,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:27,979 INFO L124 PetriNetUnfolderBase]: 910/1719 cut-off events. [2024-06-27 17:30:27,980 INFO L125 PetriNetUnfolderBase]: For 7677/7677 co-relation queries the response was YES. [2024-06-27 17:30:27,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 1719 events. 910/1719 cut-off events. For 7677/7677 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9724 event pairs, 282 based on Foata normal form. 1/1720 useless extension candidates. Maximal degree in co-relation 6421. Up to 1212 conditions per place. [2024-06-27 17:30:27,993 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 82 selfloop transitions, 71 changer transitions 45/199 dead transitions. [2024-06-27 17:30:27,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 199 transitions, 2254 flow [2024-06-27 17:30:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:30:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:30:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2024-06-27 17:30:27,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-06-27 17:30:27,996 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 988 flow. Second operand 18 states and 250 transitions. [2024-06-27 17:30:27,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 199 transitions, 2254 flow [2024-06-27 17:30:28,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 199 transitions, 2168 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 17:30:28,031 INFO L231 Difference]: Finished difference. Result has 117 places, 134 transitions, 1695 flow [2024-06-27 17:30:28,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1695, PETRI_PLACES=117, PETRI_TRANSITIONS=134} [2024-06-27 17:30:28,035 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places. [2024-06-27 17:30:28,035 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 134 transitions, 1695 flow [2024-06-27 17:30:28,035 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-06-27 17:30:28,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:28,036 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-06-27 17:30:28,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:30:28,036 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-06-27 17:30:28,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1330315432, now seen corresponding path program 2 times [2024-06-27 17:30:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578928462] [2024-06-27 17:30:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578928462] [2024-06-27 17:30:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578928462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-06-27 17:30:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920224888] [2024-06-27 17:30:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:28,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 17:30:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 17:30:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-06-27 17:30:28,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:28,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 134 transitions, 1695 flow. Second operand has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 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-06-27 17:30:28,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:28,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:28,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:30,005 INFO L124 PetriNetUnfolderBase]: 1117/2118 cut-off events. [2024-06-27 17:30:30,006 INFO L125 PetriNetUnfolderBase]: For 11086/11086 co-relation queries the response was YES. [2024-06-27 17:30:30,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9445 conditions, 2118 events. 1117/2118 cut-off events. For 11086/11086 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12692 event pairs, 376 based on Foata normal form. 2/2120 useless extension candidates. Maximal degree in co-relation 9370. Up to 1504 conditions per place. [2024-06-27 17:30:30,022 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 137 selfloop transitions, 95 changer transitions 35/268 dead transitions. [2024-06-27 17:30:30,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 268 transitions, 3458 flow [2024-06-27 17:30:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-06-27 17:30:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-06-27 17:30:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 316 transitions. [2024-06-27 17:30:30,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2747826086956522 [2024-06-27 17:30:30,024 INFO L175 Difference]: Start difference. First operand has 117 places, 134 transitions, 1695 flow. Second operand 23 states and 316 transitions. [2024-06-27 17:30:30,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 268 transitions, 3458 flow [2024-06-27 17:30:30,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 268 transitions, 3273 flow, removed 64 selfloop flow, removed 12 redundant places. [2024-06-27 17:30:30,079 INFO L231 Difference]: Finished difference. Result has 130 places, 181 transitions, 2510 flow [2024-06-27 17:30:30,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2510, PETRI_PLACES=130, PETRI_TRANSITIONS=181} [2024-06-27 17:30:30,080 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-06-27 17:30:30,081 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 181 transitions, 2510 flow [2024-06-27 17:30:30,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 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-06-27 17:30:30,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:30,081 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-06-27 17:30:30,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:30:30,082 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-06-27 17:30:30,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2105977878, now seen corresponding path program 3 times [2024-06-27 17:30:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977759571] [2024-06-27 17:30:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977759571] [2024-06-27 17:30:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977759571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:30,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:30,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 17:30:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474608867] [2024-06-27 17:30:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:30,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:30:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:30:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:30:30,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:30,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 181 transitions, 2510 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-06-27 17:30:30,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:30,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:30,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:31,631 INFO L124 PetriNetUnfolderBase]: 1204/2317 cut-off events. [2024-06-27 17:30:31,631 INFO L125 PetriNetUnfolderBase]: For 13787/13787 co-relation queries the response was YES. [2024-06-27 17:30:31,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10748 conditions, 2317 events. 1204/2317 cut-off events. For 13787/13787 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14419 event pairs, 351 based on Foata normal form. 2/2319 useless extension candidates. Maximal degree in co-relation 10663. Up to 1412 conditions per place. [2024-06-27 17:30:31,649 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 147 selfloop transitions, 121 changer transitions 35/304 dead transitions. [2024-06-27 17:30:31,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 304 transitions, 4283 flow [2024-06-27 17:30:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 17:30:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 17:30:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2024-06-27 17:30:31,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2024-06-27 17:30:31,652 INFO L175 Difference]: Start difference. First operand has 130 places, 181 transitions, 2510 flow. Second operand 19 states and 277 transitions. [2024-06-27 17:30:31,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 304 transitions, 4283 flow [2024-06-27 17:30:31,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 304 transitions, 4176 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-06-27 17:30:31,712 INFO L231 Difference]: Finished difference. Result has 147 places, 217 transitions, 3232 flow [2024-06-27 17:30:31,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3232, PETRI_PLACES=147, PETRI_TRANSITIONS=217} [2024-06-27 17:30:31,713 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places. [2024-06-27 17:30:31,713 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 3232 flow [2024-06-27 17:30:31,714 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-06-27 17:30:31,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:31,714 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-06-27 17:30:31,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:30:31,714 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-06-27 17:30:31,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 892164174, now seen corresponding path program 4 times [2024-06-27 17:30:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:31,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635797341] [2024-06-27 17:30:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635797341] [2024-06-27 17:30:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635797341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:32,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 17:30:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146381707] [2024-06-27 17:30:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:32,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:30:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:30:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:30:32,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:32,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 3232 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-06-27 17:30:32,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:32,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:32,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:33,408 INFO L124 PetriNetUnfolderBase]: 1324/2587 cut-off events. [2024-06-27 17:30:33,408 INFO L125 PetriNetUnfolderBase]: For 17881/17881 co-relation queries the response was YES. [2024-06-27 17:30:33,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12812 conditions, 2587 events. 1324/2587 cut-off events. For 17881/17881 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16647 event pairs, 411 based on Foata normal form. 2/2589 useless extension candidates. Maximal degree in co-relation 12710. Up to 1580 conditions per place. [2024-06-27 17:30:33,427 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 180 selfloop transitions, 124 changer transitions 36/341 dead transitions. [2024-06-27 17:30:33,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 341 transitions, 5040 flow [2024-06-27 17:30:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-06-27 17:30:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-06-27 17:30:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2024-06-27 17:30:33,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2024-06-27 17:30:33,429 INFO L175 Difference]: Start difference. First operand has 147 places, 217 transitions, 3232 flow. Second operand 23 states and 325 transitions. [2024-06-27 17:30:33,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 341 transitions, 5040 flow [2024-06-27 17:30:33,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 341 transitions, 4895 flow, removed 51 selfloop flow, removed 5 redundant places. [2024-06-27 17:30:33,504 INFO L231 Difference]: Finished difference. Result has 173 places, 247 transitions, 3979 flow [2024-06-27 17:30:33,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3126, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3979, PETRI_PLACES=173, PETRI_TRANSITIONS=247} [2024-06-27 17:30:33,505 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 128 predicate places. [2024-06-27 17:30:33,505 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 247 transitions, 3979 flow [2024-06-27 17:30:33,505 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-06-27 17:30:33,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:33,505 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-06-27 17:30:33,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:30:33,506 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-06-27 17:30:33,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash -197311664, now seen corresponding path program 5 times [2024-06-27 17:30:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456393763] [2024-06-27 17:30:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456393763] [2024-06-27 17:30:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456393763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 17:30:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692620318] [2024-06-27 17:30:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:34,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:30:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:34,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:30:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:30:34,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:34,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 247 transitions, 3979 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-06-27 17:30:34,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:34,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:34,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:35,534 INFO L124 PetriNetUnfolderBase]: 1356/2737 cut-off events. [2024-06-27 17:30:35,535 INFO L125 PetriNetUnfolderBase]: For 20192/20192 co-relation queries the response was YES. [2024-06-27 17:30:35,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13879 conditions, 2737 events. 1356/2737 cut-off events. For 20192/20192 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18502 event pairs, 506 based on Foata normal form. 1/2738 useless extension candidates. Maximal degree in co-relation 13742. Up to 1810 conditions per place. [2024-06-27 17:30:35,555 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 191 selfloop transitions, 124 changer transitions 37/353 dead transitions. [2024-06-27 17:30:35,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 353 transitions, 5659 flow [2024-06-27 17:30:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:30:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:30:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 265 transitions. [2024-06-27 17:30:35,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2024-06-27 17:30:35,557 INFO L175 Difference]: Start difference. First operand has 173 places, 247 transitions, 3979 flow. Second operand 18 states and 265 transitions. [2024-06-27 17:30:35,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 353 transitions, 5659 flow [2024-06-27 17:30:35,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 353 transitions, 5574 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 17:30:35,655 INFO L231 Difference]: Finished difference. Result has 187 places, 269 transitions, 4630 flow [2024-06-27 17:30:35,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3913, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4630, PETRI_PLACES=187, PETRI_TRANSITIONS=269} [2024-06-27 17:30:35,656 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 142 predicate places. [2024-06-27 17:30:35,656 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 269 transitions, 4630 flow [2024-06-27 17:30:35,657 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-06-27 17:30:35,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:35,657 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-06-27 17:30:35,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:30:35,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 17:30:35,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash -381577138, now seen corresponding path program 6 times [2024-06-27 17:30:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:35,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194183129] [2024-06-27 17:30:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:36,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194183129] [2024-06-27 17:30:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194183129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:36,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:36,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 17:30:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578699030] [2024-06-27 17:30:36,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:36,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:30:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:30:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:30:36,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-06-27 17:30:36,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 269 transitions, 4630 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-06-27 17:30:36,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:36,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-06-27 17:30:36,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:37,640 INFO L124 PetriNetUnfolderBase]: 1286/2601 cut-off events. [2024-06-27 17:30:37,641 INFO L125 PetriNetUnfolderBase]: For 21997/21997 co-relation queries the response was YES. [2024-06-27 17:30:37,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13768 conditions, 2601 events. 1286/2601 cut-off events. For 21997/21997 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17319 event pairs, 488 based on Foata normal form. 1/2602 useless extension candidates. Maximal degree in co-relation 13629. Up to 1774 conditions per place. [2024-06-27 17:30:37,688 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 180 selfloop transitions, 124 changer transitions 40/345 dead transitions. [2024-06-27 17:30:37,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 345 transitions, 5747 flow [2024-06-27 17:30:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:30:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:30:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 311 transitions. [2024-06-27 17:30:37,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2827272727272727 [2024-06-27 17:30:37,706 INFO L175 Difference]: Start difference. First operand has 187 places, 269 transitions, 4630 flow. Second operand 22 states and 311 transitions. [2024-06-27 17:30:37,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 345 transitions, 5747 flow [2024-06-27 17:30:37,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 345 transitions, 5631 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-06-27 17:30:37,914 INFO L231 Difference]: Finished difference. Result has 200 places, 260 transitions, 4638 flow [2024-06-27 17:30:37,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4638, PETRI_PLACES=200, PETRI_TRANSITIONS=260} [2024-06-27 17:30:37,915 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 155 predicate places. [2024-06-27 17:30:37,916 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 260 transitions, 4638 flow [2024-06-27 17:30:37,916 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-06-27 17:30:37,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:37,916 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-06-27 17:30:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 17:30:37,918 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 17:30:37,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1690025402, now seen corresponding path program 7 times [2024-06-27 17:30:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:37,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202756576] [2024-06-27 17:30:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:37,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:30:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:38,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:30:38,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:30:38,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-06-27 17:30:38,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 17:30:38,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-06-27 17:30:38,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-06-27 17:30:38,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-27 17:30:38,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-27 17:30:38,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 17:30:38,088 INFO L445 BasicCegarLoop]: Path program histogram: [7, 4, 1, 1, 1] [2024-06-27 17:30:38,092 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:30:38,092 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:30:38,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:30:38 BasicIcfg [2024-06-27 17:30:38,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:30:38,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:30:38,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:30:38,178 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:30:38,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:20" (3/4) ... [2024-06-27 17:30:38,179 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:30:38,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:30:38,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:30:38,268 INFO L158 Benchmark]: Toolchain (without parser) took 19126.45ms. Allocated memory was 151.0MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 110.3MB in the beginning and 487.1MB in the end (delta: -376.8MB). Peak memory consumption was 504.8MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,268 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:38,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.99ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 74.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.32ms. Allocated memory is still 151.0MB. Free memory was 74.6MB in the beginning and 72.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,269 INFO L158 Benchmark]: Boogie Preprocessor took 84.19ms. Allocated memory is still 151.0MB. Free memory was 72.4MB in the beginning and 68.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,269 INFO L158 Benchmark]: RCFGBuilder took 657.94ms. Allocated memory is still 151.0MB. Free memory was 68.4MB in the beginning and 106.5MB in the end (delta: -38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,269 INFO L158 Benchmark]: TraceAbstraction took 17655.78ms. Allocated memory was 151.0MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 105.6MB in the beginning and 495.5MB in the end (delta: -389.9MB). Peak memory consumption was 493.8MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,269 INFO L158 Benchmark]: Witness Printer took 89.53ms. Allocated memory is still 1.0GB. Free memory was 495.5MB in the beginning and 487.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-27 17:30:38,270 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.13ms. Allocated memory is still 115.3MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.99ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 74.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.32ms. Allocated memory is still 151.0MB. Free memory was 74.6MB in the beginning and 72.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.19ms. Allocated memory is still 151.0MB. Free memory was 72.4MB in the beginning and 68.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 657.94ms. Allocated memory is still 151.0MB. Free memory was 68.4MB in the beginning and 106.5MB in the end (delta: -38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17655.78ms. Allocated memory was 151.0MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 105.6MB in the beginning and 495.5MB in the end (delta: -389.9MB). Peak memory consumption was 493.8MB. Max. memory is 16.1GB. * Witness Printer took 89.53ms. Allocated memory is still 1.0GB. Free memory was 495.5MB in the beginning and 487.1MB 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; [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 [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-2, t2=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 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-2, t2=-1] [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-2, t2=-1] [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 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-2, t2=-1] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-2, t2=-1] [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-2, t2=-1] [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-2, t2=-1] [L3917] 1 return 0; [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-2, t2=-1] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-2, t2=-1] [L3917] 2 return 0; [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-2, t2=-1] [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(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-2, t2=-1] [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(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-2, t2=-1] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-2, t2=-1] - 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: 17.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1476 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1414 mSDsluCounter, 1245 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1169 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6273 IncrementalHoareTripleChecker+Invalid, 6457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 76 mSDtfsCounter, 6273 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4638occurred in iteration=13, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 3657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-06-27 17:30:38,318 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