./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:20:28,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:20:28,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:20:28,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:20:28,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:20:28,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:20:28,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:20:28,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:20:28,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:20:28,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:20:28,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:20:28,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:20:28,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:20:28,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:20:28,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:20:28,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:20:28,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:20:28,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:20:28,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:20:28,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:20:28,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:20:28,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:20:28,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:20:28,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:20:28,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:20:28,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:20:28,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:20:28,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:20:28,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:20:28,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:20:28,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:20:28,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:20:28,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:28,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:20:28,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:20:28,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:20:28,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:20:28,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:20:28,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:20:28,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:20:28,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:20:28,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:20:28,544 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-11-10 10:20:28,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:20:28,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:20:28,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:20:28,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:20:28,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:20:28,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-10 10:20:30,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:20:30,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:20:30,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-10 10:20:30,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452acfa83/4c51d59d9d614e20bb8060ebef6572b4/FLAGaa48088d0 [2024-11-10 10:20:30,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452acfa83/4c51d59d9d614e20bb8060ebef6572b4 [2024-11-10 10:20:30,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:20:30,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:20:30,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:30,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:20:30,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:20:30,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:30" (1/1) ... [2024-11-10 10:20:30,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b93934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:30, skipping insertion in model container [2024-11-10 10:20:30,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:30" (1/1) ... [2024-11-10 10:20:30,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:20:31,255 WARN L250 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-11-10 10:20:31,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:31,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:20:31,324 WARN L250 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-11-10 10:20:31,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:31,425 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:20:31,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31 WrapperNode [2024-11-10 10:20:31,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:31,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:31,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:20:31,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:20:31,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,503 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-11-10 10:20:31,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:31,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:20:31,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:20:31,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:20:31,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,548 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2024-11-10 10:20:31,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:20:31,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:20:31,578 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:20:31,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:20:31,579 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (1/1) ... [2024-11-10 10:20:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:20:31,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:20:31,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:20:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-10 10:20:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-10 10:20:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:20:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 10:20:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 10:20:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:20:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:20:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:20:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:20:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 10:20:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:20:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:20:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:20:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:20:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:20:31,679 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:20:31,905 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:20:31,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:20:32,112 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:20:32,112 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:20:32,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:20:32,293 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:20:32,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:32 BoogieIcfgContainer [2024-11-10 10:20:32,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:20:32,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:20:32,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:20:32,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:20:32,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:20:30" (1/3) ... [2024-11-10 10:20:32,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dd7f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:32, skipping insertion in model container [2024-11-10 10:20:32,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:31" (2/3) ... [2024-11-10 10:20:32,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dd7f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:32, skipping insertion in model container [2024-11-10 10:20:32,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:32" (3/3) ... [2024-11-10 10:20:32,302 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-11-10 10:20:32,316 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:20:32,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 10:20:32,316 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:20:32,359 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:20:32,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2024-11-10 10:20:32,427 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2024-11-10 10:20:32,427 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:20:32,431 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 7. Compared 138 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-11-10 10:20:32,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2024-11-10 10:20:32,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2024-11-10 10:20:32,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:32,447 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;@27b64caf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:32,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:20:32,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:32,454 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-11-10 10:20:32,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:32,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:32,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:32,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:32,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1965821653, now seen corresponding path program 1 times [2024-11-10 10:20:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636167250] [2024-11-10 10:20:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636167250] [2024-11-10 10:20:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636167250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90172804] [2024-11-10 10:20:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:33,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:20:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:20:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:20:33,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:33,049 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-11-10 10:20:33,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:33,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:33,284 INFO L124 PetriNetUnfolderBase]: 466/820 cut-off events. [2024-11-10 10:20:33,284 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 10:20:33,286 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 3457 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-11-10 10:20:33,292 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-11-10 10:20:33,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2024-11-10 10:20:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:20:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:20:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-10 10:20:33,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-11-10 10:20:33,306 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2024-11-10 10:20:33,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2024-11-10 10:20:33,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:20:33,313 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2024-11-10 10:20:33,315 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-11-10 10:20:33,318 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2024-11-10 10:20:33,320 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2024-11-10 10:20:33,320 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-11-10 10:20:33,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:33,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:33,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:20:33,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:33,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash -630988046, now seen corresponding path program 1 times [2024-11-10 10:20:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090097218] [2024-11-10 10:20:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:33,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090097218] [2024-11-10 10:20:33,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090097218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:20:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415200205] [2024-11-10 10:20:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:33,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:20:33,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:20:33,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:20:33,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:33,514 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-11-10 10:20:33,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:33,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:33,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:33,705 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-11-10 10:20:33,705 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-10 10:20:33,708 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 5270 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-11-10 10:20:33,713 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2024-11-10 10:20:33,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2024-11-10 10:20:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:20:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:20:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-10 10:20:33,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-11-10 10:20:33,717 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2024-11-10 10:20:33,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2024-11-10 10:20:33,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:33,720 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2024-11-10 10:20:33,721 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-11-10 10:20:33,721 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-10 10:20:33,721 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2024-11-10 10:20:33,722 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-11-10 10:20:33,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:33,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:33,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:20:33,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:33,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 245947419, now seen corresponding path program 1 times [2024-11-10 10:20:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:33,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138010953] [2024-11-10 10:20:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:33,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138010953] [2024-11-10 10:20:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138010953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:33,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:33,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:20:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113937701] [2024-11-10 10:20:33,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:33,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:20:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:20:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:20:33,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-11-10 10:20:33,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-11-10 10:20:33,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:33,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-11-10 10:20:33,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:33,926 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2024-11-10 10:20:33,926 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-10 10:20:33,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 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 1483 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 910. Up to 219 conditions per place. [2024-11-10 10:20:33,928 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 44 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-11-10 10:20:33,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 224 flow [2024-11-10 10:20:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:20:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:20:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-11-10 10:20:33,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-11-10 10:20:33,929 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 91 transitions. [2024-11-10 10:20:33,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 224 flow [2024-11-10 10:20:33,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:20:33,931 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2024-11-10 10:20:33,931 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-11-10 10:20:33,931 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2024-11-10 10:20:33,932 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2024-11-10 10:20:33,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-11-10 10:20:33,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:33,932 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-11-10 10:20:33,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:20:33,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:33,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash -922808822, now seen corresponding path program 1 times [2024-11-10 10:20:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228081024] [2024-11-10 10:20:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228081024] [2024-11-10 10:20:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228081024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:20:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858180595] [2024-11-10 10:20:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:35,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:35,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:35,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:35,065 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-11-10 10:20:35,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:35,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:36,120 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2024-11-10 10:20:36,120 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-11-10 10:20:36,122 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 3145 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-11-10 10:20:36,125 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-11-10 10:20:36,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 485 flow [2024-11-10 10:20:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 10:20:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 10:20:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2024-11-10 10:20:36,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2024-11-10 10:20:36,128 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 13 states and 205 transitions. [2024-11-10 10:20:36,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 485 flow [2024-11-10 10:20:36,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:36,131 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 186 flow [2024-11-10 10:20:36,132 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-11-10 10:20:36,132 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-11-10 10:20:36,133 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 186 flow [2024-11-10 10:20:36,133 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-11-10 10:20:36,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:36,133 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-11-10 10:20:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:20:36,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:36,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash 759821580, now seen corresponding path program 2 times [2024-11-10 10:20:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370706938] [2024-11-10 10:20:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370706938] [2024-11-10 10:20:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370706938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:20:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984702637] [2024-11-10 10:20:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:36,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:20:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:36,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:20:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:20:36,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:36,951 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-11-10 10:20:36,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:36,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:37,383 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2024-11-10 10:20:37,384 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2024-11-10 10:20:37,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 870 events. 469/870 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4133 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-11-10 10:20:37,394 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 25 changer transitions 0/102 dead transitions. [2024-11-10 10:20:37,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 637 flow [2024-11-10 10:20:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:20:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:20:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-11-10 10:20:37,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2024-11-10 10:20:37,400 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 186 flow. Second operand 11 states and 169 transitions. [2024-11-10 10:20:37,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 637 flow [2024-11-10 10:20:37,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:20:37,409 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 348 flow [2024-11-10 10:20:37,409 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-11-10 10:20:37,410 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-11-10 10:20:37,410 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 348 flow [2024-11-10 10:20:37,410 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-11-10 10:20:37,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:37,410 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-11-10 10:20:37,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:20:37,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1690482564, now seen corresponding path program 3 times [2024-11-10 10:20:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049537637] [2024-11-10 10:20:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049537637] [2024-11-10 10:20:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049537637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:37,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:20:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571298618] [2024-11-10 10:20:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:37,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:37,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:37,969 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-11-10 10:20:37,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:37,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:37,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:38,558 INFO L124 PetriNetUnfolderBase]: 646/1205 cut-off events. [2024-11-10 10:20:38,558 INFO L125 PetriNetUnfolderBase]: For 2110/2110 co-relation queries the response was YES. [2024-11-10 10:20:38,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1205 events. 646/1205 cut-off events. For 2110/2110 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6157 event pairs, 50 based on Foata normal form. 1/1206 useless extension candidates. Maximal degree in co-relation 3788. Up to 441 conditions per place. [2024-11-10 10:20:38,565 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 85 selfloop transitions, 39 changer transitions 0/126 dead transitions. [2024-11-10 10:20:38,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 126 transitions, 943 flow [2024-11-10 10:20:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 10:20:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 10:20:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2024-11-10 10:20:38,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2024-11-10 10:20:38,566 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 348 flow. Second operand 14 states and 207 transitions. [2024-11-10 10:20:38,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 126 transitions, 943 flow [2024-11-10 10:20:38,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 126 transitions, 918 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-10 10:20:38,577 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 610 flow [2024-11-10 10:20:38,577 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=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=610, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2024-11-10 10:20:38,580 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-11-10 10:20:38,580 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 610 flow [2024-11-10 10:20:38,580 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-11-10 10:20:38,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:38,580 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-11-10 10:20:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:20:38,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1388012464, now seen corresponding path program 4 times [2024-11-10 10:20:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:38,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272549088] [2024-11-10 10:20:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272549088] [2024-11-10 10:20:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272549088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:38,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:20:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831939856] [2024-11-10 10:20:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:38,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:20:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:20:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:20:38,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:38,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 610 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-11-10 10:20:38,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:38,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:38,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:39,229 INFO L124 PetriNetUnfolderBase]: 760/1457 cut-off events. [2024-11-10 10:20:39,230 INFO L125 PetriNetUnfolderBase]: For 4365/4365 co-relation queries the response was YES. [2024-11-10 10:20:39,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 1457 events. 760/1457 cut-off events. For 4365/4365 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8010 event pairs, 36 based on Foata normal form. 1/1458 useless extension candidates. Maximal degree in co-relation 4901. Up to 441 conditions per place. [2024-11-10 10:20:39,239 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 81 selfloop transitions, 54 changer transitions 0/137 dead transitions. [2024-11-10 10:20:39,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 137 transitions, 1287 flow [2024-11-10 10:20:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:20:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:20:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-11-10 10:20:39,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31272727272727274 [2024-11-10 10:20:39,241 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 610 flow. Second operand 11 states and 172 transitions. [2024-11-10 10:20:39,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 137 transitions, 1287 flow [2024-11-10 10:20:39,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1247 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 10:20:39,256 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 973 flow [2024-11-10 10:20:39,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=973, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-11-10 10:20:39,258 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-11-10 10:20:39,258 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 973 flow [2024-11-10 10:20:39,259 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-11-10 10:20:39,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:39,259 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-11-10 10:20:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:20:39,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash 904520338, now seen corresponding path program 5 times [2024-11-10 10:20:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135869775] [2024-11-10 10:20:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:39,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135869775] [2024-11-10 10:20:39,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135869775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:39,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:39,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:20:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820084957] [2024-11-10 10:20:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:39,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:39,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:39,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:39,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 973 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-11-10 10:20:39,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:39,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:39,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:40,413 INFO L124 PetriNetUnfolderBase]: 760/1455 cut-off events. [2024-11-10 10:20:40,414 INFO L125 PetriNetUnfolderBase]: For 6452/6452 co-relation queries the response was YES. [2024-11-10 10:20:40,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1455 events. 760/1455 cut-off events. For 6452/6452 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7975 event pairs, 149 based on Foata normal form. 1/1456 useless extension candidates. Maximal degree in co-relation 5449. Up to 335 conditions per place. [2024-11-10 10:20:40,423 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 111 selfloop transitions, 55 changer transitions 0/167 dead transitions. [2024-11-10 10:20:40,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 167 transitions, 1701 flow [2024-11-10 10:20:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 10:20:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-10 10:20:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2024-11-10 10:20:40,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2024-11-10 10:20:40,425 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 973 flow. Second operand 15 states and 229 transitions. [2024-11-10 10:20:40,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 167 transitions, 1701 flow [2024-11-10 10:20:40,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 167 transitions, 1643 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-10 10:20:40,453 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 1160 flow [2024-11-10 10:20:40,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1160, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2024-11-10 10:20:40,454 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2024-11-10 10:20:40,454 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 1160 flow [2024-11-10 10:20:40,454 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-11-10 10:20:40,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:40,455 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-11-10 10:20:40,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:20:40,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:40,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1851776215, now seen corresponding path program 1 times [2024-11-10 10:20:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854110296] [2024-11-10 10:20:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854110296] [2024-11-10 10:20:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854110296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:41,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:41,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:20:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187184820] [2024-11-10 10:20:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:41,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:41,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:41,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:41,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:41,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 1160 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-11-10 10:20:41,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:41,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:42,720 INFO L124 PetriNetUnfolderBase]: 948/1803 cut-off events. [2024-11-10 10:20:42,720 INFO L125 PetriNetUnfolderBase]: For 11091/11091 co-relation queries the response was YES. [2024-11-10 10:20:42,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 1803 events. 948/1803 cut-off events. For 11091/11091 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10380 event pairs, 298 based on Foata normal form. 1/1804 useless extension candidates. Maximal degree in co-relation 7021. Up to 1266 conditions per place. [2024-11-10 10:20:42,741 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 84 selfloop transitions, 73 changer transitions 45/203 dead transitions. [2024-11-10 10:20:42,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 2608 flow [2024-11-10 10:20:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 10:20:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-10 10:20:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2024-11-10 10:20:42,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-11-10 10:20:42,744 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 1160 flow. Second operand 18 states and 250 transitions. [2024-11-10 10:20:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 2608 flow [2024-11-10 10:20:42,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 203 transitions, 2510 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-11-10 10:20:42,830 INFO L231 Difference]: Finished difference. Result has 123 places, 137 transitions, 2018 flow [2024-11-10 10:20:42,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2018, PETRI_PLACES=123, PETRI_TRANSITIONS=137} [2024-11-10 10:20:42,832 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 78 predicate places. [2024-11-10 10:20:42,833 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 137 transitions, 2018 flow [2024-11-10 10:20:42,833 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-11-10 10:20:42,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:42,834 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-11-10 10:20:42,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:20:42,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash -637724015, now seen corresponding path program 2 times [2024-11-10 10:20:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876318384] [2024-11-10 10:20:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876318384] [2024-11-10 10:20:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876318384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:43,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:20:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194256795] [2024-11-10 10:20:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:43,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:43,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:43,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 137 transitions, 2018 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-11-10 10:20:43,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:43,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:43,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:44,574 INFO L124 PetriNetUnfolderBase]: 1079/2082 cut-off events. [2024-11-10 10:20:44,575 INFO L125 PetriNetUnfolderBase]: For 14567/14567 co-relation queries the response was YES. [2024-11-10 10:20:44,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 2082 events. 1079/2082 cut-off events. For 14567/14567 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12716 event pairs, 379 based on Foata normal form. 2/2084 useless extension candidates. Maximal degree in co-relation 9535. Up to 1470 conditions per place. [2024-11-10 10:20:44,588 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 139 selfloop transitions, 83 changer transitions 35/258 dead transitions. [2024-11-10 10:20:44,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 258 transitions, 3696 flow [2024-11-10 10:20:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 10:20:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-10 10:20:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2024-11-10 10:20:44,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2024-11-10 10:20:44,590 INFO L175 Difference]: Start difference. First operand has 123 places, 137 transitions, 2018 flow. Second operand 19 states and 277 transitions. [2024-11-10 10:20:44,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 258 transitions, 3696 flow [2024-11-10 10:20:44,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 258 transitions, 3552 flow, removed 58 selfloop flow, removed 10 redundant places. [2024-11-10 10:20:44,664 INFO L231 Difference]: Finished difference. Result has 129 places, 172 transitions, 2591 flow [2024-11-10 10:20:44,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2591, PETRI_PLACES=129, PETRI_TRANSITIONS=172} [2024-11-10 10:20:44,665 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 84 predicate places. [2024-11-10 10:20:44,665 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 172 transitions, 2591 flow [2024-11-10 10:20:44,665 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-11-10 10:20:44,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:44,665 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-11-10 10:20:44,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:20:44,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:44,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1588841, now seen corresponding path program 3 times [2024-11-10 10:20:44,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:44,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830201445] [2024-11-10 10:20:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830201445] [2024-11-10 10:20:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830201445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:20:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301557224] [2024-11-10 10:20:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:45,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:45,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 172 transitions, 2591 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-11-10 10:20:45,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:45,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:45,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:46,890 INFO L124 PetriNetUnfolderBase]: 1199/2352 cut-off events. [2024-11-10 10:20:46,891 INFO L125 PetriNetUnfolderBase]: For 16885/16885 co-relation queries the response was YES. [2024-11-10 10:20:46,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 2352 events. 1199/2352 cut-off events. For 16885/16885 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14878 event pairs, 396 based on Foata normal form. 2/2354 useless extension candidates. Maximal degree in co-relation 11042. Up to 1404 conditions per place. [2024-11-10 10:20:46,917 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 149 selfloop transitions, 109 changer transitions 36/295 dead transitions. [2024-11-10 10:20:46,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 295 transitions, 4270 flow [2024-11-10 10:20:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 10:20:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-10 10:20:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2024-11-10 10:20:46,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2024-11-10 10:20:46,920 INFO L175 Difference]: Start difference. First operand has 129 places, 172 transitions, 2591 flow. Second operand 23 states and 325 transitions. [2024-11-10 10:20:46,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 295 transitions, 4270 flow [2024-11-10 10:20:47,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 295 transitions, 4122 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-11-10 10:20:47,093 INFO L231 Difference]: Finished difference. Result has 154 places, 202 transitions, 3286 flow [2024-11-10 10:20:47,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2479, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3286, PETRI_PLACES=154, PETRI_TRANSITIONS=202} [2024-11-10 10:20:47,094 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places. [2024-11-10 10:20:47,094 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 202 transitions, 3286 flow [2024-11-10 10:20:47,095 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-11-10 10:20:47,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:47,095 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-11-10 10:20:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:20:47,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1786926389, now seen corresponding path program 4 times [2024-11-10 10:20:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397532870] [2024-11-10 10:20:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:47,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397532870] [2024-11-10 10:20:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397532870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:47,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:47,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:20:47,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856238931] [2024-11-10 10:20:47,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:47,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:47,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:47,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-10 10:20:47,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 202 transitions, 3286 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-11-10 10:20:47,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:47,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-10 10:20:47,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:48,790 INFO L124 PetriNetUnfolderBase]: 1229/2478 cut-off events. [2024-11-10 10:20:48,791 INFO L125 PetriNetUnfolderBase]: For 19331/19331 co-relation queries the response was YES. [2024-11-10 10:20:48,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12323 conditions, 2478 events. 1229/2478 cut-off events. For 19331/19331 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16384 event pairs, 510 based on Foata normal form. 2/2480 useless extension candidates. Maximal degree in co-relation 12203. Up to 1716 conditions per place. [2024-11-10 10:20:48,811 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 187 selfloop transitions, 95 changer transitions 32/315 dead transitions. [2024-11-10 10:20:48,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 315 transitions, 4945 flow [2024-11-10 10:20:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 10:20:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-10 10:20:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 308 transitions. [2024-11-10 10:20:48,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2024-11-10 10:20:48,817 INFO L175 Difference]: Start difference. First operand has 154 places, 202 transitions, 3286 flow. Second operand 21 states and 308 transitions. [2024-11-10 10:20:48,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 315 transitions, 4945 flow [2024-11-10 10:20:49,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 315 transitions, 4871 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-10 10:20:49,080 INFO L231 Difference]: Finished difference. Result has 173 places, 223 transitions, 3819 flow [2024-11-10 10:20:49,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3819, PETRI_PLACES=173, PETRI_TRANSITIONS=223} [2024-11-10 10:20:49,081 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 128 predicate places. [2024-11-10 10:20:49,081 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 223 transitions, 3819 flow [2024-11-10 10:20:49,081 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-11-10 10:20:49,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:49,081 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-11-10 10:20:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:20:49,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -549227763, now seen corresponding path program 5 times [2024-11-10 10:20:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618498603] [2024-11-10 10:20:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:49,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:49,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:49,161 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:49,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:20:49,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:20:49,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-10 10:20:49,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-10 10:20:49,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-10 10:20:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-10 10:20:49,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:20:49,167 INFO L407 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1] [2024-11-10 10:20:49,233 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:20:49,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:20:49,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:20:49 BasicIcfg [2024-11-10 10:20:49,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:20:49,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:20:49,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:20:49,242 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:20:49,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:32" (3/4) ... [2024-11-10 10:20:49,243 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:20:49,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:20:49,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:20:49,315 INFO L158 Benchmark]: Toolchain (without parser) took 18567.98ms. Allocated memory was 184.5MB in the beginning and 725.6MB in the end (delta: 541.1MB). Free memory was 128.1MB in the beginning and 258.7MB in the end (delta: -130.6MB). Peak memory consumption was 411.3MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,316 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:20:49,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.23ms. Allocated memory is still 184.5MB. Free memory was 128.1MB in the beginning and 90.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.25ms. Allocated memory is still 184.5MB. Free memory was 90.3MB in the beginning and 87.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,316 INFO L158 Benchmark]: Boogie Preprocessor took 71.84ms. Allocated memory is still 184.5MB. Free memory was 87.5MB in the beginning and 84.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,317 INFO L158 Benchmark]: IcfgBuilder took 716.30ms. Allocated memory was 184.5MB in the beginning and 287.3MB in the end (delta: 102.8MB). Free memory was 84.1MB in the beginning and 243.2MB in the end (delta: -159.1MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,317 INFO L158 Benchmark]: TraceAbstraction took 16945.12ms. Allocated memory was 287.3MB in the beginning and 725.6MB in the end (delta: 438.3MB). Free memory was 243.2MB in the beginning and 266.0MB in the end (delta: -22.8MB). Peak memory consumption was 416.5MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,317 INFO L158 Benchmark]: Witness Printer took 72.74ms. Allocated memory is still 725.6MB. Free memory was 266.0MB in the beginning and 258.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 10:20:49,319 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.15ms. Allocated memory is still 184.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.23ms. Allocated memory is still 184.5MB. Free memory was 128.1MB in the beginning and 90.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.25ms. Allocated memory is still 184.5MB. Free memory was 90.3MB in the beginning and 87.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.84ms. Allocated memory is still 184.5MB. Free memory was 87.5MB in the beginning and 84.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 716.30ms. Allocated memory was 184.5MB in the beginning and 287.3MB in the end (delta: 102.8MB). Free memory was 84.1MB in the beginning and 243.2MB in the end (delta: -159.1MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16945.12ms. Allocated memory was 287.3MB in the beginning and 725.6MB in the end (delta: 438.3MB). Free memory was 243.2MB in the beginning and 266.0MB in the end (delta: -22.8MB). Peak memory consumption was 416.5MB. Max. memory is 16.1GB. * Witness Printer took 72.74ms. Allocated memory is still 725.6MB. Free memory was 266.0MB in the beginning and 258.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [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=-1, t2=0] [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=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; 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=-1, t2=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=-1, t2=0] [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=-1, t2=0] [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=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] [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=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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. - 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. - 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: 16.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1086 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1074 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4978 IncrementalHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 31 mSDtfsCounter, 4978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3819occurred in iteration=12, InterpolantAutomatonStates: 156, 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, 7.3s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 2843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11-10 10:20:49,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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