./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 14:20:13,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:20:13,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:20:13,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:20:13,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:20:13,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:20:13,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:20:13,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:20:13,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:20:13,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:20:13,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:20:13,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:20:13,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:20:13,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:20:13,682 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:20:13,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:20:13,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:20:13,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:20:13,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:20:13,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:20:13,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:20:13,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:20:13,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:20:13,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:20:13,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:20:13,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:20:13,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:20:13,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:20:13,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:20:13,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:20:13,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:20:13,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:20:13,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:20:13,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:20:13,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:20:13,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:20:13,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:20:13,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:20:13,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:20:13,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:20:13,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:20:13,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:20:13,699 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-clean/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-clean/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-11 14:20:14,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:20:14,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:20:14,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:20:14,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:20:14,115 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:20:14,116 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-11 14:20:15,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:20:15,854 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:20:15,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-11 14:20:15,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/69fecdf16/ebbf42e6598944e0a874e17e47a6cb20/FLAG53a6dc134 [2024-10-11 14:20:15,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/69fecdf16/ebbf42e6598944e0a874e17e47a6cb20 [2024-10-11 14:20:15,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:20:15,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:20:15,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:20:15,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:20:15,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:20:15,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:20:15" (1/1) ... [2024-10-11 14:20:15,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259e70da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:15, skipping insertion in model container [2024-10-11 14:20:15,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:20:15" (1/1) ... [2024-10-11 14:20:16,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:20:16,275 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-11 14:20:16,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:20:16,312 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:20:16,362 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-11 14:20:16,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:20:16,423 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:20:16,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16 WrapperNode [2024-10-11 14:20:16,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:20:16,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:20:16,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:20:16,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:20:16,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,482 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-10-11 14:20:16,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:20:16,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:20:16,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:20:16,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:20:16,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,514 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 2, 11]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-10-11 14:20:16,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:20:16,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:20:16,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:20:16,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:20:16,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (1/1) ... [2024-10-11 14:20:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:20:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:20:16,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:20:16,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:20:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-11 14:20:16,632 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-11 14:20:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:20:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:20:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:20:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:20:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:20:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:20:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:20:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:20:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:20:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:20:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:20:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:20:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:20:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:20:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:20:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:20:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:20:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:20:16,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:20:16,638 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:20:16,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:20:16,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:20:17,042 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:20:17,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:20:17,155 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:20:17,155 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:20:17,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:17 BoogieIcfgContainer [2024-10-11 14:20:17,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:20:17,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:20:17,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:20:17,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:20:17,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:20:15" (1/3) ... [2024-10-11 14:20:17,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cad2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:20:17, skipping insertion in model container [2024-10-11 14:20:17,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:16" (2/3) ... [2024-10-11 14:20:17,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cad2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:20:17, skipping insertion in model container [2024-10-11 14:20:17,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:17" (3/3) ... [2024-10-11 14:20:17,163 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-10-11 14:20:17,175 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:20:17,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 14:20:17,175 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:20:17,212 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:20:17,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2024-10-11 14:20:17,269 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2024-10-11 14:20:17,270 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:20:17,273 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-11 14:20:17,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2024-10-11 14:20:17,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2024-10-11 14:20:17,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:20:17,291 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;@310f34b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:20:17,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:20:17,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:20:17,299 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-11 14:20:17,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:20:17,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:17,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:17,300 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-11 14:20:17,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1544696618, now seen corresponding path program 1 times [2024-10-11 14:20:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997816524] [2024-10-11 14:20:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:17,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:17,859 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-11 14:20:17,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:17,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997816524] [2024-10-11 14:20:17,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997816524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:17,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:17,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:20:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256886901] [2024-10-11 14:20:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:17,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:20:17,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:20:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:20:17,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:17,925 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-11 14:20:17,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:17,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:17,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:18,170 INFO L124 PetriNetUnfolderBase]: 466/820 cut-off events. [2024-10-11 14:20:18,171 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 14:20:18,173 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-11 14:20:18,180 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-10-11 14:20:18,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2024-10-11 14:20:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:20:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:20:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-11 14:20:18,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-10-11 14:20:18,193 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2024-10-11 14:20:18,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2024-10-11 14:20:18,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 14:20:18,200 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2024-10-11 14:20:18,203 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-11 14:20:18,207 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2024-10-11 14:20:18,207 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2024-10-11 14:20:18,208 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-11 14:20:18,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:18,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:18,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:20:18,209 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-11 14:20:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1605291128, now seen corresponding path program 1 times [2024-10-11 14:20:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088698139] [2024-10-11 14:20:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:18,420 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-11 14:20:18,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:18,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088698139] [2024-10-11 14:20:18,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088698139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:18,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:20:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679772341] [2024-10-11 14:20:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:18,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:20:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:20:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:20:18,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:18,440 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-11 14:20:18,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:18,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:18,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:18,657 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-10-11 14:20:18,658 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-11 14:20:18,661 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-11 14:20:18,665 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2024-10-11 14:20:18,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2024-10-11 14:20:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:20:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:20:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-10-11 14:20:18,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-10-11 14:20:18,668 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2024-10-11 14:20:18,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2024-10-11 14:20:18,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:18,673 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2024-10-11 14:20:18,674 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-11 14:20:18,675 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-10-11 14:20:18,676 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2024-10-11 14:20:18,676 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-11 14:20:18,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:18,676 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:18,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:20:18,676 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-11 14:20:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1671475294, now seen corresponding path program 1 times [2024-10-11 14:20:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229279190] [2024-10-11 14:20:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:18,740 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-11 14:20:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229279190] [2024-10-11 14:20:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229279190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:20:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696666402] [2024-10-11 14:20:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:20:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:20:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:20:18,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-10-11 14:20:18,743 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-11 14:20:18,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:18,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-10-11 14:20:18,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:18,840 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2024-10-11 14:20:18,840 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-10-11 14:20:18,841 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-11 14:20:18,842 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-10-11 14:20:18,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2024-10-11 14:20:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:20:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:20:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-10-11 14:20:18,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-10-11 14:20:18,844 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2024-10-11 14:20:18,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2024-10-11 14:20:18,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:20:18,845 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2024-10-11 14:20:18,846 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-11 14:20:18,846 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2024-10-11 14:20:18,846 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2024-10-11 14:20:18,847 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-11 14:20:18,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:18,847 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-11 14:20:18,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:20:18,847 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-11 14:20:18,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash -897843709, now seen corresponding path program 1 times [2024-10-11 14:20:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:18,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363305063] [2024-10-11 14:20:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:19,982 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-11 14:20:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363305063] [2024-10-11 14:20:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363305063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:19,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:20:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603940073] [2024-10-11 14:20:19,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:19,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:20:19,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:19,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:20:19,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:20:20,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:20,004 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-11 14:20:20,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:20,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:20,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:20,483 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2024-10-11 14:20:20,483 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-10-11 14:20:20,484 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-11 14:20:20,486 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-10-11 14:20:20,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 485 flow [2024-10-11 14:20:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:20:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 14:20:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2024-10-11 14:20:20,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2024-10-11 14:20:20,488 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 13 states and 205 transitions. [2024-10-11 14:20:20,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 485 flow [2024-10-11 14:20:20,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:20,490 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 186 flow [2024-10-11 14:20:20,490 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-11 14:20:20,491 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-10-11 14:20:20,491 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 186 flow [2024-10-11 14:20:20,491 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-11 14:20:20,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:20,491 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-11 14:20:20,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:20:20,492 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-11 14:20:20,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1109055311, now seen corresponding path program 2 times [2024-10-11 14:20:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:20,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101166567] [2024-10-11 14:20:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:21,156 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-11 14:20:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101166567] [2024-10-11 14:20:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101166567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:20:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954991582] [2024-10-11 14:20:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:21,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:20:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:20:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:20:21,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:21,166 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-11 14:20:21,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:21,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:21,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:21,457 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2024-10-11 14:20:21,457 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2024-10-11 14:20:21,459 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-11 14:20:21,461 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 25 changer transitions 0/102 dead transitions. [2024-10-11 14:20:21,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 637 flow [2024-10-11 14:20:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:20:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:20:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-10-11 14:20:21,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2024-10-11 14:20:21,463 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 186 flow. Second operand 11 states and 169 transitions. [2024-10-11 14:20:21,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 637 flow [2024-10-11 14:20:21,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:20:21,466 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 348 flow [2024-10-11 14:20:21,466 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-11 14:20:21,467 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-10-11 14:20:21,467 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 348 flow [2024-10-11 14:20:21,467 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-11 14:20:21,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:21,467 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-11 14:20:21,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:20:21,468 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-11 14:20:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 620403633, now seen corresponding path program 3 times [2024-10-11 14:20:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417326136] [2024-10-11 14:20:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:22,127 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-11 14:20:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417326136] [2024-10-11 14:20:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417326136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:22,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:20:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563174936] [2024-10-11 14:20:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:20:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:22,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:20:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:20:22,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:22,141 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-11 14:20:22,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:22,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:22,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:22,730 INFO L124 PetriNetUnfolderBase]: 722/1373 cut-off events. [2024-10-11 14:20:22,730 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-10-11 14:20:22,732 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-11 14:20:22,736 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 97 selfloop transitions, 58 changer transitions 0/157 dead transitions. [2024-10-11 14:20:22,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1190 flow [2024-10-11 14:20:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 14:20:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 14:20:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 254 transitions. [2024-10-11 14:20:22,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2988235294117647 [2024-10-11 14:20:22,738 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 348 flow. Second operand 17 states and 254 transitions. [2024-10-11 14:20:22,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1190 flow [2024-10-11 14:20:22,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 157 transitions, 1157 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-10-11 14:20:22,749 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 842 flow [2024-10-11 14:20:22,750 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-11 14:20:22,751 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2024-10-11 14:20:22,752 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 842 flow [2024-10-11 14:20:22,752 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-11 14:20:22,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:22,753 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-11 14:20:22,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:20:22,753 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-11 14:20:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -316558351, now seen corresponding path program 4 times [2024-10-11 14:20:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357677907] [2024-10-11 14:20:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:22,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:23,348 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-11 14:20:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357677907] [2024-10-11 14:20:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357677907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:20:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390551049] [2024-10-11 14:20:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:20:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:20:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:20:23,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:23,365 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-11 14:20:23,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:23,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:23,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:23,968 INFO L124 PetriNetUnfolderBase]: 722/1371 cut-off events. [2024-10-11 14:20:23,968 INFO L125 PetriNetUnfolderBase]: For 4558/4558 co-relation queries the response was YES. [2024-10-11 14:20:23,972 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-11 14:20:23,976 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 110 selfloop transitions, 52 changer transitions 0/163 dead transitions. [2024-10-11 14:20:23,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 163 transitions, 1533 flow [2024-10-11 14:20:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 14:20:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-11 14:20:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2024-10-11 14:20:23,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2024-10-11 14:20:23,977 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 842 flow. Second operand 15 states and 229 transitions. [2024-10-11 14:20:23,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 163 transitions, 1533 flow [2024-10-11 14:20:23,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 163 transitions, 1439 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-10-11 14:20:23,994 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 988 flow [2024-10-11 14:20:23,995 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-11 14:20:23,995 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-10-11 14:20:23,995 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 988 flow [2024-10-11 14:20:23,996 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-11 14:20:23,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:23,996 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-11 14:20:23,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:20:23,996 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-11 14:20:23,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1930621198, now seen corresponding path program 1 times [2024-10-11 14:20:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:23,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068111257] [2024-10-11 14:20:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:24,718 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-11 14:20:24,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:24,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068111257] [2024-10-11 14:20:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068111257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:24,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:24,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:20:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863098978] [2024-10-11 14:20:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:24,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:20:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:20:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:20:24,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:24,744 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-11 14:20:24,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:24,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:24,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:25,463 INFO L124 PetriNetUnfolderBase]: 910/1719 cut-off events. [2024-10-11 14:20:25,464 INFO L125 PetriNetUnfolderBase]: For 7677/7677 co-relation queries the response was YES. [2024-10-11 14:20:25,468 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-11 14:20:25,474 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 82 selfloop transitions, 71 changer transitions 45/199 dead transitions. [2024-10-11 14:20:25,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 199 transitions, 2254 flow [2024-10-11 14:20:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 14:20:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 14:20:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2024-10-11 14:20:25,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-10-11 14:20:25,477 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 988 flow. Second operand 18 states and 250 transitions. [2024-10-11 14:20:25,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 199 transitions, 2254 flow [2024-10-11 14:20:25,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 199 transitions, 2168 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-10-11 14:20:25,504 INFO L231 Difference]: Finished difference. Result has 117 places, 134 transitions, 1695 flow [2024-10-11 14:20:25,504 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-11 14:20:25,504 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places. [2024-10-11 14:20:25,505 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 134 transitions, 1695 flow [2024-10-11 14:20:25,505 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-11 14:20:25,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:25,505 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-11 14:20:25,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:20:25,505 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-11 14:20:25,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1330315432, now seen corresponding path program 2 times [2024-10-11 14:20:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179306440] [2024-10-11 14:20:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:26,515 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-11 14:20:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179306440] [2024-10-11 14:20:26,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179306440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:26,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 14:20:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244626466] [2024-10-11 14:20:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:20:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:20:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:20:26,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:26,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 134 transitions, 1695 flow. Second operand has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:26,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:26,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:26,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:28,214 INFO L124 PetriNetUnfolderBase]: 1117/2118 cut-off events. [2024-10-11 14:20:28,215 INFO L125 PetriNetUnfolderBase]: For 11086/11086 co-relation queries the response was YES. [2024-10-11 14:20:28,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9445 conditions, 2118 events. 1117/2118 cut-off events. For 11086/11086 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12692 event pairs, 376 based on Foata normal form. 2/2120 useless extension candidates. Maximal degree in co-relation 9370. Up to 1504 conditions per place. [2024-10-11 14:20:28,227 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 137 selfloop transitions, 95 changer transitions 35/268 dead transitions. [2024-10-11 14:20:28,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 268 transitions, 3458 flow [2024-10-11 14:20:28,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 14:20:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-11 14:20:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 316 transitions. [2024-10-11 14:20:28,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2747826086956522 [2024-10-11 14:20:28,230 INFO L175 Difference]: Start difference. First operand has 117 places, 134 transitions, 1695 flow. Second operand 23 states and 316 transitions. [2024-10-11 14:20:28,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 268 transitions, 3458 flow [2024-10-11 14:20:28,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 268 transitions, 3273 flow, removed 64 selfloop flow, removed 12 redundant places. [2024-10-11 14:20:28,270 INFO L231 Difference]: Finished difference. Result has 130 places, 181 transitions, 2510 flow [2024-10-11 14:20:28,270 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=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2510, PETRI_PLACES=130, PETRI_TRANSITIONS=181} [2024-10-11 14:20:28,271 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-10-11 14:20:28,271 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 181 transitions, 2510 flow [2024-10-11 14:20:28,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:28,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:28,272 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-11 14:20:28,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:20:28,272 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-11 14:20:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2105977878, now seen corresponding path program 3 times [2024-10-11 14:20:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:28,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952125478] [2024-10-11 14:20:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:29,056 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-11 14:20:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952125478] [2024-10-11 14:20:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952125478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:29,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:20:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778810592] [2024-10-11 14:20:29,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:29,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:20:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:29,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:20:29,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:20:29,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:29,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 181 transitions, 2510 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:29,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:29,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:29,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:29,973 INFO L124 PetriNetUnfolderBase]: 1204/2317 cut-off events. [2024-10-11 14:20:29,973 INFO L125 PetriNetUnfolderBase]: For 13787/13787 co-relation queries the response was YES. [2024-10-11 14:20:29,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10748 conditions, 2317 events. 1204/2317 cut-off events. For 13787/13787 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14419 event pairs, 351 based on Foata normal form. 2/2319 useless extension candidates. Maximal degree in co-relation 10663. Up to 1412 conditions per place. [2024-10-11 14:20:29,989 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 147 selfloop transitions, 121 changer transitions 35/304 dead transitions. [2024-10-11 14:20:29,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 304 transitions, 4283 flow [2024-10-11 14:20:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 14:20:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 14:20:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2024-10-11 14:20:29,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2024-10-11 14:20:29,991 INFO L175 Difference]: Start difference. First operand has 130 places, 181 transitions, 2510 flow. Second operand 19 states and 277 transitions. [2024-10-11 14:20:29,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 304 transitions, 4283 flow [2024-10-11 14:20:30,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 304 transitions, 4176 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-10-11 14:20:30,039 INFO L231 Difference]: Finished difference. Result has 147 places, 217 transitions, 3232 flow [2024-10-11 14:20:30,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3232, PETRI_PLACES=147, PETRI_TRANSITIONS=217} [2024-10-11 14:20:30,040 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places. [2024-10-11 14:20:30,040 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 3232 flow [2024-10-11 14:20:30,040 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-11 14:20:30,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:30,040 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-11 14:20:30,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:20:30,041 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-11 14:20:30,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash 892164174, now seen corresponding path program 4 times [2024-10-11 14:20:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992870988] [2024-10-11 14:20:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:30,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-11 14:20:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992870988] [2024-10-11 14:20:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992870988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:30,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:30,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:20:30,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964051058] [2024-10-11 14:20:30,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:30,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:20:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:20:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:20:30,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:30,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 3232 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:30,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:30,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:30,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:31,878 INFO L124 PetriNetUnfolderBase]: 1324/2587 cut-off events. [2024-10-11 14:20:31,879 INFO L125 PetriNetUnfolderBase]: For 17881/17881 co-relation queries the response was YES. [2024-10-11 14:20:31,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12812 conditions, 2587 events. 1324/2587 cut-off events. For 17881/17881 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16647 event pairs, 411 based on Foata normal form. 2/2589 useless extension candidates. Maximal degree in co-relation 12710. Up to 1580 conditions per place. [2024-10-11 14:20:31,902 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 180 selfloop transitions, 124 changer transitions 36/341 dead transitions. [2024-10-11 14:20:31,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 341 transitions, 5040 flow [2024-10-11 14:20:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 14:20:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-11 14:20:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2024-10-11 14:20:31,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2024-10-11 14:20:31,905 INFO L175 Difference]: Start difference. First operand has 147 places, 217 transitions, 3232 flow. Second operand 23 states and 325 transitions. [2024-10-11 14:20:31,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 341 transitions, 5040 flow [2024-10-11 14:20:32,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 341 transitions, 4895 flow, removed 51 selfloop flow, removed 5 redundant places. [2024-10-11 14:20:32,029 INFO L231 Difference]: Finished difference. Result has 173 places, 247 transitions, 3979 flow [2024-10-11 14:20:32,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3126, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3979, PETRI_PLACES=173, PETRI_TRANSITIONS=247} [2024-10-11 14:20:32,029 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 128 predicate places. [2024-10-11 14:20:32,029 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 247 transitions, 3979 flow [2024-10-11 14:20:32,030 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-11 14:20:32,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:32,030 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-11 14:20:32,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:20:32,031 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-11 14:20:32,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -197311664, now seen corresponding path program 5 times [2024-10-11 14:20:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:32,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399847582] [2024-10-11 14:20:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:32,787 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-11 14:20:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399847582] [2024-10-11 14:20:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399847582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:20:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565417401] [2024-10-11 14:20:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:32,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:20:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:32,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:20:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:20:32,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:32,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 247 transitions, 3979 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:32,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:32,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:32,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:33,820 INFO L124 PetriNetUnfolderBase]: 1356/2737 cut-off events. [2024-10-11 14:20:33,820 INFO L125 PetriNetUnfolderBase]: For 20192/20192 co-relation queries the response was YES. [2024-10-11 14:20:33,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13879 conditions, 2737 events. 1356/2737 cut-off events. For 20192/20192 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18502 event pairs, 506 based on Foata normal form. 1/2738 useless extension candidates. Maximal degree in co-relation 13742. Up to 1810 conditions per place. [2024-10-11 14:20:33,845 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 191 selfloop transitions, 124 changer transitions 37/353 dead transitions. [2024-10-11 14:20:33,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 353 transitions, 5659 flow [2024-10-11 14:20:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 14:20:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 14:20:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 265 transitions. [2024-10-11 14:20:33,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2024-10-11 14:20:33,847 INFO L175 Difference]: Start difference. First operand has 173 places, 247 transitions, 3979 flow. Second operand 18 states and 265 transitions. [2024-10-11 14:20:33,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 353 transitions, 5659 flow [2024-10-11 14:20:33,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 353 transitions, 5574 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-10-11 14:20:33,943 INFO L231 Difference]: Finished difference. Result has 187 places, 269 transitions, 4630 flow [2024-10-11 14:20:33,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3913, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4630, PETRI_PLACES=187, PETRI_TRANSITIONS=269} [2024-10-11 14:20:33,944 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 142 predicate places. [2024-10-11 14:20:33,944 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 269 transitions, 4630 flow [2024-10-11 14:20:33,944 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-11 14:20:33,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:33,944 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-11 14:20:33,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:20:33,944 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-11 14:20:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -381577138, now seen corresponding path program 6 times [2024-10-11 14:20:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249222806] [2024-10-11 14:20:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:34,596 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-11 14:20:34,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:34,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249222806] [2024-10-11 14:20:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249222806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:34,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:20:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501819411] [2024-10-11 14:20:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:34,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:20:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:20:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:20:34,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-10-11 14:20:34,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 269 transitions, 4630 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:34,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:34,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-10-11 14:20:34,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:35,573 INFO L124 PetriNetUnfolderBase]: 1286/2601 cut-off events. [2024-10-11 14:20:35,573 INFO L125 PetriNetUnfolderBase]: For 21997/21997 co-relation queries the response was YES. [2024-10-11 14:20:35,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13768 conditions, 2601 events. 1286/2601 cut-off events. For 21997/21997 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17319 event pairs, 488 based on Foata normal form. 1/2602 useless extension candidates. Maximal degree in co-relation 13629. Up to 1774 conditions per place. [2024-10-11 14:20:35,593 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 180 selfloop transitions, 124 changer transitions 40/345 dead transitions. [2024-10-11 14:20:35,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 345 transitions, 5747 flow [2024-10-11 14:20:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 14:20:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 14:20:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 311 transitions. [2024-10-11 14:20:35,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2827272727272727 [2024-10-11 14:20:35,594 INFO L175 Difference]: Start difference. First operand has 187 places, 269 transitions, 4630 flow. Second operand 22 states and 311 transitions. [2024-10-11 14:20:35,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 345 transitions, 5747 flow [2024-10-11 14:20:35,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 345 transitions, 5631 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-10-11 14:20:35,689 INFO L231 Difference]: Finished difference. Result has 200 places, 260 transitions, 4638 flow [2024-10-11 14:20:35,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4638, PETRI_PLACES=200, PETRI_TRANSITIONS=260} [2024-10-11 14:20:35,691 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 155 predicate places. [2024-10-11 14:20:35,691 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 260 transitions, 4638 flow [2024-10-11 14:20:35,691 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-11 14:20:35,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:35,691 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-11 14:20:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:20:35,691 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-11 14:20:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1690025402, now seen corresponding path program 7 times [2024-10-11 14:20:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274156268] [2024-10-11 14:20:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:20:35,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:20:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:20:35,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:20:35,768 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:20:35,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-11 14:20:35,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-11 14:20:35,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-10-11 14:20:35,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-11 14:20:35,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-11 14:20:35,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-10-11 14:20:35,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:20:35,774 INFO L407 BasicCegarLoop]: Path program histogram: [7, 4, 1, 1, 1] [2024-10-11 14:20:35,829 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:20:35,829 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:20:35,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:20:35 BasicIcfg [2024-10-11 14:20:35,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:20:35,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:20:35,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:20:35,838 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:20:35,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:17" (3/4) ... [2024-10-11 14:20:35,838 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:20:35,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:20:35,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:20:35,908 INFO L158 Benchmark]: Toolchain (without parser) took 20003.74ms. Allocated memory was 140.5MB in the beginning and 931.1MB in the end (delta: 790.6MB). Free memory was 66.9MB in the beginning and 726.5MB in the end (delta: -659.6MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,908 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 140.5MB. Free memory was 90.4MB in the beginning and 90.2MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:20:35,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.62ms. Allocated memory was 140.5MB in the beginning and 197.1MB in the end (delta: 56.6MB). Free memory was 66.8MB in the beginning and 138.4MB in the end (delta: -71.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.08ms. Allocated memory is still 197.1MB. Free memory was 138.4MB in the beginning and 135.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,916 INFO L158 Benchmark]: Boogie Preprocessor took 57.40ms. Allocated memory is still 197.1MB. Free memory was 135.3MB in the beginning and 132.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,916 INFO L158 Benchmark]: RCFGBuilder took 613.80ms. Allocated memory is still 197.1MB. Free memory was 131.9MB in the beginning and 93.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,917 INFO L158 Benchmark]: TraceAbstraction took 18678.88ms. Allocated memory was 197.1MB in the beginning and 931.1MB in the end (delta: 734.0MB). Free memory was 92.3MB in the beginning and 734.9MB in the end (delta: -642.7MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,917 INFO L158 Benchmark]: Witness Printer took 69.96ms. Allocated memory is still 931.1MB. Free memory was 733.9MB in the beginning and 726.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:20:35,918 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.11ms. Allocated memory is still 140.5MB. Free memory was 90.4MB in the beginning and 90.2MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.62ms. Allocated memory was 140.5MB in the beginning and 197.1MB in the end (delta: 56.6MB). Free memory was 66.8MB in the beginning and 138.4MB in the end (delta: -71.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.08ms. Allocated memory is still 197.1MB. Free memory was 138.4MB in the beginning and 135.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.40ms. Allocated memory is still 197.1MB. Free memory was 135.3MB in the beginning and 132.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.80ms. Allocated memory is still 197.1MB. Free memory was 131.9MB in the beginning and 93.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18678.88ms. Allocated memory was 197.1MB in the beginning and 931.1MB in the end (delta: 734.0MB). Free memory was 92.3MB in the beginning and 734.9MB in the end (delta: -642.7MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. * Witness Printer took 69.96ms. Allocated memory is still 931.1MB. Free memory was 733.9MB in the beginning and 726.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-2, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-2, t2=-1] [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-2, t2=-1] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-2, t2=-1] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-2, t2=-1] [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-2, t2=-1] [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-2, t2=-1] [L3917] 1 return 0; [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-2, t2=-1] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-2, t2=-1] [L3917] 2 return 0; [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-2, t2=-1] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-2, t2=-1] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-2, t2=-1] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-2, t2=-1] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 52 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1476 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1414 mSDsluCounter, 1245 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1169 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6273 IncrementalHoareTripleChecker+Invalid, 6457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 76 mSDtfsCounter, 6273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4638occurred in iteration=13, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 3657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 14:20:35,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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