./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:59:59,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:59:59,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:59:59,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:59:59,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:59:59,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:59:59,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:59:59,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:59:59,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:59:59,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:59:59,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:59:59,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:59:59,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:59:59,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:59:59,555 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:59:59,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:59:59,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:59:59,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:59:59,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:59:59,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:59:59,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:59:59,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:59:59,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:59:59,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:59:59,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:59:59,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:59:59,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:59:59,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:59:59,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:59:59,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:59:59,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:59:59,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:59:59,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:59:59,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:59:59,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:59:59,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:59:59,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:59:59,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:59:59,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:59:59,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:59:59,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:59:59,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:59:59,564 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-10-13 06:59:59,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:59:59,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:59:59,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:59:59,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:59:59,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:59:59,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-13 07:00:01,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:00:01,736 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:00:01,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-13 07:00:01,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af94e8ba6/b1a29ab69dbe4137b2fc9b934017f3bd/FLAGd6b2bb937 [2024-10-13 07:00:01,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af94e8ba6/b1a29ab69dbe4137b2fc9b934017f3bd [2024-10-13 07:00:01,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:00:01,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:00:01,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:00:01,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:00:01,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:00:01,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:00:01" (1/1) ... [2024-10-13 07:00:01,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3b4c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:01, skipping insertion in model container [2024-10-13 07:00:01,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:00:01" (1/1) ... [2024-10-13 07:00:01,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:00:02,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2024-10-13 07:00:02,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:00:02,398 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:00:02,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2024-10-13 07:00:02,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:00:02,531 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:00:02,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02 WrapperNode [2024-10-13 07:00:02,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:00:02,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:00:02,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:00:02,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:00:02,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,600 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-10-13 07:00:02,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:00:02,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:00:02,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:00:02,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:00:02,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,656 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 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, 6, 2]. [2024-10-13 07:00:02,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:00:02,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:00:02,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:00:02,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:00:02,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (1/1) ... [2024-10-13 07:00:02,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:00:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:00:02,759 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-10-13 07:00:02,762 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-10-13 07:00:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-13 07:00:02,809 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-13 07:00:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 07:00:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:00:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:00:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 07:00:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:00:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:00:02,813 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 07:00:03,067 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:00:03,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:00:03,315 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 07:00:03,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:00:03,436 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:00:03,436 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 07:00:03,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:00:03 BoogieIcfgContainer [2024-10-13 07:00:03,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:00:03,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:00:03,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:00:03,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:00:03,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:00:01" (1/3) ... [2024-10-13 07:00:03,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d513e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:00:03, skipping insertion in model container [2024-10-13 07:00:03,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:02" (2/3) ... [2024-10-13 07:00:03,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d513e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:00:03, skipping insertion in model container [2024-10-13 07:00:03,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:00:03" (3/3) ... [2024-10-13 07:00:03,446 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-10-13 07:00:03,507 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:00:03,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 07:00:03,507 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 07:00:03,598 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 07:00:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2024-10-13 07:00:03,663 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2024-10-13 07:00:03,663 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 07:00:03,666 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-10-13 07:00:03,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2024-10-13 07:00:03,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2024-10-13 07:00:03,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:00:03,697 INFO L333 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, 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;@533ed288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:00:03,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 07:00:03,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 07:00:03,706 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-13 07:00:03,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 07:00:03,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:03,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:00:03,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:03,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1544696618, now seen corresponding path program 1 times [2024-10-13 07:00:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:03,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884825138] [2024-10-13 07:00:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884825138] [2024-10-13 07:00:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884825138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:04,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 07:00:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585883302] [2024-10-13 07:00:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:04,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:00:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:04,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:00:04,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:00:04,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:04,408 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-10-13 07:00:04,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:04,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:04,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:04,703 INFO L124 PetriNetUnfolderBase]: 466/820 cut-off events. [2024-10-13 07:00:04,703 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-13 07:00:04,706 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 3460 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-10-13 07:00:04,714 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-10-13 07:00:04,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2024-10-13 07:00:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:00:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 07:00:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-13 07:00:04,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-10-13 07:00:04,727 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2024-10-13 07:00:04,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2024-10-13 07:00:04,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 07:00:04,733 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2024-10-13 07:00:04,737 INFO L260 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-10-13 07:00:04,742 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2024-10-13 07:00:04,743 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2024-10-13 07:00:04,743 INFO L472 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-10-13 07:00:04,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:04,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:00:04,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:00:04,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:04,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1605291128, now seen corresponding path program 1 times [2024-10-13 07:00:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714576643] [2024-10-13 07:00:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714576643] [2024-10-13 07:00:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714576643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:00:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349807394] [2024-10-13 07:00:04,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:04,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:00:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:00:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:00:05,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:05,008 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-10-13 07:00:05,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:05,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:05,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:05,276 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-10-13 07:00:05,276 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-13 07:00:05,279 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-10-13 07:00:05,285 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2024-10-13 07:00:05,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2024-10-13 07:00:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:00:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 07:00:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-10-13 07:00:05,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-10-13 07:00:05,289 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2024-10-13 07:00:05,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2024-10-13 07:00:05,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 07:00:05,293 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2024-10-13 07:00:05,293 INFO L260 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-10-13 07:00:05,295 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-10-13 07:00:05,295 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2024-10-13 07:00:05,295 INFO L472 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-10-13 07:00:05,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:05,296 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:00:05,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:00:05,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1671475294, now seen corresponding path program 1 times [2024-10-13 07:00:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130752083] [2024-10-13 07:00:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:05,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:05,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130752083] [2024-10-13 07:00:05,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130752083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:05,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:00:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216489918] [2024-10-13 07:00:05,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:05,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:00:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:00:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:00:05,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-10-13 07:00:05,428 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-10-13 07:00:05,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:05,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-10-13 07:00:05,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:05,593 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2024-10-13 07:00:05,593 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-10-13 07:00:05,594 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-10-13 07:00:05,596 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-10-13 07:00:05,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2024-10-13 07:00:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:00:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 07:00:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-10-13 07:00:05,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-10-13 07:00:05,600 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2024-10-13 07:00:05,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2024-10-13 07:00:05,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 07:00:05,605 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2024-10-13 07:00:05,605 INFO L260 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-10-13 07:00:05,607 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2024-10-13 07:00:05,607 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2024-10-13 07:00:05,608 INFO L472 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-10-13 07:00:05,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:05,608 INFO L204 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-10-13 07:00:05,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:00:05,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:05,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash -897843709, now seen corresponding path program 1 times [2024-10-13 07:00:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117363666] [2024-10-13 07:00:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:05,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:06,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-10-13 07:00:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117363666] [2024-10-13 07:00:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117363666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:06,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 07:00:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914594644] [2024-10-13 07:00:06,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:06,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 07:00:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 07:00:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 07:00:06,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:06,801 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-10-13 07:00:06,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:06,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:06,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:07,597 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2024-10-13 07:00:07,598 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-10-13 07:00:07,599 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-10-13 07:00:07,602 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-10-13 07:00:07,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 485 flow [2024-10-13 07:00:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 07:00:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 07:00:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2024-10-13 07:00:07,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2024-10-13 07:00:07,608 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 13 states and 205 transitions. [2024-10-13 07:00:07,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 485 flow [2024-10-13 07:00:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 07:00:07,611 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 186 flow [2024-10-13 07:00:07,612 INFO L260 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-10-13 07:00:07,613 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-10-13 07:00:07,614 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 186 flow [2024-10-13 07:00:07,614 INFO L472 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-10-13 07:00:07,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:07,614 INFO L204 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-10-13 07:00:07,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 07:00:07,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1109055311, now seen corresponding path program 2 times [2024-10-13 07:00:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567127731] [2024-10-13 07:00:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567127731] [2024-10-13 07:00:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567127731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 07:00:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340871530] [2024-10-13 07:00:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 07:00:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 07:00:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 07:00:08,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:08,512 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-10-13 07:00:08,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:08,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:08,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:08,873 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2024-10-13 07:00:08,873 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2024-10-13 07:00:08,876 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-10-13 07:00:08,880 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 25 changer transitions 0/102 dead transitions. [2024-10-13 07:00:08,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 637 flow [2024-10-13 07:00:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 07:00:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 07:00:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-10-13 07:00:08,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2024-10-13 07:00:08,883 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 186 flow. Second operand 11 states and 169 transitions. [2024-10-13 07:00:08,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 637 flow [2024-10-13 07:00:08,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 07:00:08,887 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 348 flow [2024-10-13 07:00:08,888 INFO L260 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-10-13 07:00:08,888 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-10-13 07:00:08,889 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 348 flow [2024-10-13 07:00:08,889 INFO L472 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-10-13 07:00:08,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:08,889 INFO L204 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-10-13 07:00:08,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 07:00:08,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 620403633, now seen corresponding path program 3 times [2024-10-13 07:00:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:08,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577151188] [2024-10-13 07:00:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:10,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577151188] [2024-10-13 07:00:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577151188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:10,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:10,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 07:00:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393905896] [2024-10-13 07:00:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:10,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 07:00:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 07:00:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 07:00:10,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:10,088 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-10-13 07:00:10,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:10,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:10,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:10,899 INFO L124 PetriNetUnfolderBase]: 722/1373 cut-off events. [2024-10-13 07:00:10,899 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-10-13 07:00:10,905 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-10-13 07:00:10,912 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 97 selfloop transitions, 58 changer transitions 0/157 dead transitions. [2024-10-13 07:00:10,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1190 flow [2024-10-13 07:00:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 07:00:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-13 07:00:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 254 transitions. [2024-10-13 07:00:10,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2988235294117647 [2024-10-13 07:00:10,915 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 348 flow. Second operand 17 states and 254 transitions. [2024-10-13 07:00:10,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1190 flow [2024-10-13 07:00:10,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 157 transitions, 1157 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-10-13 07:00:10,952 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 842 flow [2024-10-13 07:00:10,952 INFO L260 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-10-13 07:00:10,953 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2024-10-13 07:00:10,954 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 842 flow [2024-10-13 07:00:10,954 INFO L472 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-10-13 07:00:10,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:10,955 INFO L204 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-10-13 07:00:10,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 07:00:10,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash -316558351, now seen corresponding path program 4 times [2024-10-13 07:00:10,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:10,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847167077] [2024-10-13 07:00:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:11,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847167077] [2024-10-13 07:00:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847167077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 07:00:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167642259] [2024-10-13 07:00:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 07:00:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:11,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 07:00:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 07:00:11,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:11,772 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-10-13 07:00:11,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:11,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:11,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:12,660 INFO L124 PetriNetUnfolderBase]: 722/1371 cut-off events. [2024-10-13 07:00:12,660 INFO L125 PetriNetUnfolderBase]: For 4558/4558 co-relation queries the response was YES. [2024-10-13 07:00:12,668 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-10-13 07:00:12,676 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 110 selfloop transitions, 52 changer transitions 0/163 dead transitions. [2024-10-13 07:00:12,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 163 transitions, 1533 flow [2024-10-13 07:00:12,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 07:00:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-13 07:00:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2024-10-13 07:00:12,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2024-10-13 07:00:12,678 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 842 flow. Second operand 15 states and 229 transitions. [2024-10-13 07:00:12,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 163 transitions, 1533 flow [2024-10-13 07:00:12,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 163 transitions, 1439 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-10-13 07:00:12,712 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 988 flow [2024-10-13 07:00:12,712 INFO L260 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-10-13 07:00:12,712 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-10-13 07:00:12,713 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 988 flow [2024-10-13 07:00:12,713 INFO L472 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-10-13 07:00:12,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:12,713 INFO L204 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-10-13 07:00:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 07:00:12,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1930621198, now seen corresponding path program 1 times [2024-10-13 07:00:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676778065] [2024-10-13 07:00:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676778065] [2024-10-13 07:00:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676778065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 07:00:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135427524] [2024-10-13 07:00:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:13,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 07:00:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 07:00:13,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:00:13,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:13,855 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-10-13 07:00:13,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:13,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:13,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:14,827 INFO L124 PetriNetUnfolderBase]: 910/1719 cut-off events. [2024-10-13 07:00:14,828 INFO L125 PetriNetUnfolderBase]: For 7677/7677 co-relation queries the response was YES. [2024-10-13 07:00:14,834 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-10-13 07:00:14,843 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 82 selfloop transitions, 71 changer transitions 45/199 dead transitions. [2024-10-13 07:00:14,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 199 transitions, 2254 flow [2024-10-13 07:00:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 07:00:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-13 07:00:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2024-10-13 07:00:14,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-10-13 07:00:14,848 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 988 flow. Second operand 18 states and 250 transitions. [2024-10-13 07:00:14,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 199 transitions, 2254 flow [2024-10-13 07:00:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 199 transitions, 2168 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-10-13 07:00:14,889 INFO L231 Difference]: Finished difference. Result has 117 places, 134 transitions, 1695 flow [2024-10-13 07:00:14,889 INFO L260 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-10-13 07:00:14,891 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places. [2024-10-13 07:00:14,891 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 134 transitions, 1695 flow [2024-10-13 07:00:14,894 INFO L472 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-10-13 07:00:14,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:14,894 INFO L204 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-10-13 07:00:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 07:00:14,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:14,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1330315432, now seen corresponding path program 2 times [2024-10-13 07:00:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975510392] [2024-10-13 07:00:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975510392] [2024-10-13 07:00:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975510392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 07:00:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671221208] [2024-10-13 07:00:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 07:00:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 07:00:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:00:15,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:15,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 134 transitions, 1695 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-10-13 07:00:15,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:15,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:15,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:17,113 INFO L124 PetriNetUnfolderBase]: 1041/1998 cut-off events. [2024-10-13 07:00:17,114 INFO L125 PetriNetUnfolderBase]: For 10295/10295 co-relation queries the response was YES. [2024-10-13 07:00:17,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8801 conditions, 1998 events. 1041/1998 cut-off events. For 10295/10295 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11991 event pairs, 355 based on Foata normal form. 2/2000 useless extension candidates. Maximal degree in co-relation 8726. Up to 1388 conditions per place. [2024-10-13 07:00:17,136 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 136 selfloop transitions, 82 changer transitions 35/254 dead transitions. [2024-10-13 07:00:17,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 254 transitions, 3255 flow [2024-10-13 07:00:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 07:00:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-13 07:00:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2024-10-13 07:00:17,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2024-10-13 07:00:17,139 INFO L175 Difference]: Start difference. First operand has 117 places, 134 transitions, 1695 flow. Second operand 19 states and 277 transitions. [2024-10-13 07:00:17,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 254 transitions, 3255 flow [2024-10-13 07:00:17,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 254 transitions, 3085 flow, removed 61 selfloop flow, removed 12 redundant places. [2024-10-13 07:00:17,194 INFO L231 Difference]: Finished difference. Result has 121 places, 169 transitions, 2211 flow [2024-10-13 07:00:17,195 INFO L260 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=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2211, PETRI_PLACES=121, PETRI_TRANSITIONS=169} [2024-10-13 07:00:17,195 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places. [2024-10-13 07:00:17,196 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 169 transitions, 2211 flow [2024-10-13 07:00:17,196 INFO L472 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-10-13 07:00:17,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:17,196 INFO L204 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-10-13 07:00:17,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 07:00:17,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:17,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1424521552, now seen corresponding path program 3 times [2024-10-13 07:00:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680539735] [2024-10-13 07:00:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:18,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680539735] [2024-10-13 07:00:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680539735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:18,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:18,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 07:00:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367606755] [2024-10-13 07:00:18,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:18,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 07:00:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 07:00:18,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:00:18,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:18,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 169 transitions, 2211 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-10-13 07:00:18,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:18,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:18,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:19,543 INFO L124 PetriNetUnfolderBase]: 1161/2268 cut-off events. [2024-10-13 07:00:19,543 INFO L125 PetriNetUnfolderBase]: For 12342/12342 co-relation queries the response was YES. [2024-10-13 07:00:19,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 2268 events. 1161/2268 cut-off events. For 12342/12342 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14157 event pairs, 368 based on Foata normal form. 2/2270 useless extension candidates. Maximal degree in co-relation 10114. Up to 1350 conditions per place. [2024-10-13 07:00:19,566 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 148 selfloop transitions, 106 changer transitions 36/291 dead transitions. [2024-10-13 07:00:19,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 291 transitions, 3774 flow [2024-10-13 07:00:19,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 07:00:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-13 07:00:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2024-10-13 07:00:19,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2024-10-13 07:00:19,570 INFO L175 Difference]: Start difference. First operand has 121 places, 169 transitions, 2211 flow. Second operand 23 states and 325 transitions. [2024-10-13 07:00:19,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 291 transitions, 3774 flow [2024-10-13 07:00:19,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 291 transitions, 3656 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-10-13 07:00:19,640 INFO L231 Difference]: Finished difference. Result has 147 places, 199 transitions, 2872 flow [2024-10-13 07:00:19,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2872, PETRI_PLACES=147, PETRI_TRANSITIONS=199} [2024-10-13 07:00:19,643 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places. [2024-10-13 07:00:19,643 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 199 transitions, 2872 flow [2024-10-13 07:00:19,643 INFO L472 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-10-13 07:00:19,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:19,644 INFO L204 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-10-13 07:00:19,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 07:00:19,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:19,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1774463102, now seen corresponding path program 4 times [2024-10-13 07:00:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:19,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741680492] [2024-10-13 07:00:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:00:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:00:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:00:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741680492] [2024-10-13 07:00:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741680492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:00:20,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:00:20,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 07:00:20,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106090656] [2024-10-13 07:00:20,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:00:20,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 07:00:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:00:20,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 07:00:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:00:20,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-13 07:00:20,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 199 transitions, 2872 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-10-13 07:00:20,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:00:20,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-13 07:00:20,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:00:21,897 INFO L124 PetriNetUnfolderBase]: 1191/2394 cut-off events. [2024-10-13 07:00:21,897 INFO L125 PetriNetUnfolderBase]: For 14560/14560 co-relation queries the response was YES. [2024-10-13 07:00:21,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11355 conditions, 2394 events. 1191/2394 cut-off events. For 14560/14560 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15629 event pairs, 483 based on Foata normal form. 2/2396 useless extension candidates. Maximal degree in co-relation 11243. Up to 1634 conditions per place. [2024-10-13 07:00:21,927 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 184 selfloop transitions, 94 changer transitions 32/311 dead transitions. [2024-10-13 07:00:21,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 311 transitions, 4437 flow [2024-10-13 07:00:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 07:00:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-13 07:00:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 308 transitions. [2024-10-13 07:00:21,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2024-10-13 07:00:21,930 INFO L175 Difference]: Start difference. First operand has 147 places, 199 transitions, 2872 flow. Second operand 21 states and 308 transitions. [2024-10-13 07:00:21,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 311 transitions, 4437 flow [2024-10-13 07:00:22,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 311 transitions, 4362 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-10-13 07:00:22,017 INFO L231 Difference]: Finished difference. Result has 166 places, 220 transitions, 3375 flow [2024-10-13 07:00:22,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3375, PETRI_PLACES=166, PETRI_TRANSITIONS=220} [2024-10-13 07:00:22,018 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 121 predicate places. [2024-10-13 07:00:22,018 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 220 transitions, 3375 flow [2024-10-13 07:00:22,019 INFO L472 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-10-13 07:00:22,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:00:22,019 INFO L204 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-10-13 07:00:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 07:00:22,019 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 07:00:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:00:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1435623588, now seen corresponding path program 5 times [2024-10-13 07:00:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:00:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695896606] [2024-10-13 07:00:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:00:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:00:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 07:00:22,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 07:00:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 07:00:22,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 07:00:22,182 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 07:00:22,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-13 07:00:22,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-13 07:00:22,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-10-13 07:00:22,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-13 07:00:22,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-13 07:00:22,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-10-13 07:00:22,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 07:00:22,187 INFO L407 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1] [2024-10-13 07:00:22,254 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 07:00:22,257 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 07:00:22,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:00:22 BasicIcfg [2024-10-13 07:00:22,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 07:00:22,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 07:00:22,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 07:00:22,266 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 07:00:22,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:00:03" (3/4) ... [2024-10-13 07:00:22,268 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 07:00:22,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 07:00:22,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 07:00:22,344 INFO L158 Benchmark]: Toolchain (without parser) took 20543.61ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 121.7MB in the beginning and 216.5MB in the end (delta: -94.8MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,344 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 07:00:22,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.91ms. Allocated memory is still 159.4MB. Free memory was 121.7MB in the beginning and 85.0MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.22ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,345 INFO L158 Benchmark]: Boogie Preprocessor took 105.69ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 78.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,345 INFO L158 Benchmark]: RCFGBuilder took 729.34ms. Allocated memory is still 159.4MB. Free memory was 78.7MB in the beginning and 42.0MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,345 INFO L158 Benchmark]: TraceAbstraction took 18825.95ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 41.0MB in the beginning and 224.8MB in the end (delta: -183.9MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,346 INFO L158 Benchmark]: Witness Printer took 77.40ms. Allocated memory is still 539.0MB. Free memory was 224.8MB in the beginning and 216.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 07:00:22,349 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.17ms. Allocated memory is still 111.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.91ms. Allocated memory is still 159.4MB. Free memory was 121.7MB in the beginning and 85.0MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.22ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.69ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 78.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 729.34ms. Allocated memory is still 159.4MB. Free memory was 78.7MB in the beginning and 42.0MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18825.95ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 41.0MB in the beginning and 224.8MB in the end (delta: -183.9MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. * Witness Printer took 77.40ms. Allocated memory is still 539.0MB. Free memory was 224.8MB in the beginning and 216.5MB 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) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-2, t2=-1] [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] [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] [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-2, t2=-1] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [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; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; 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] [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: 18.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1206 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1163 mSDsluCounter, 1164 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1117 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4880 IncrementalHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 47 mSDtfsCounter, 4880 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3375occurred in iteration=11, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-13 07:00:22,377 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