./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.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/pthread-theta/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:39:53,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:39:53,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:39:53,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:39:53,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:39:53,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:39:53,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:39:53,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:39:53,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:39:53,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:39:53,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:39:53,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:39:53,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:39:53,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:39:53,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:39:53,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:39:53,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:39:53,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:39:53,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:39:53,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:39:53,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:39:53,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:39:53,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:39:53,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:39:53,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:39:53,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:39:53,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:39:53,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:39:53,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:39:53,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:39:53,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:39:53,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:39:53,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:39:53,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:39:53,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:39:53,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:39:53,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:39:53,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:39:53,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:39:53,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:39:53,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:39:53,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:39:53,133 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-10 10:39:53,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:39:53,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:39:53,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:39:53,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:39:53,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:39:53,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-10 10:39:54,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:39:55,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:39:55,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-10 10:39:55,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e2e5570/555d6840338b4b909417b11929bf477d/FLAG64e856217 [2024-11-10 10:39:55,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e2e5570/555d6840338b4b909417b11929bf477d [2024-11-10 10:39:55,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:39:55,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:39:55,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:39:55,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:39:55,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:39:55,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:55" (1/1) ... [2024-11-10 10:39:55,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c14b1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:55, skipping insertion in model container [2024-11-10 10:39:55,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:55" (1/1) ... [2024-11-10 10:39:55,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:39:55,966 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/pthread-theta/unwind2-1.i[33026,33039] [2024-11-10 10:39:55,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:39:55,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:39:56,047 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/pthread-theta/unwind2-1.i[33026,33039] [2024-11-10 10:39:56,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:39:56,096 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:39:56,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56 WrapperNode [2024-11-10 10:39:56,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:39:56,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:39:56,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:39:56,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:39:56,106 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:39:56" (1/1) ... [2024-11-10 10:39:56,125 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:39:56" (1/1) ... [2024-11-10 10:39:56,149 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2024-11-10 10:39:56,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:39:56,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:39:56,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:39:56,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:39:56,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 10:39:56,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:39:56,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:39:56,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:39:56,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:39:56,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (1/1) ... [2024-11-10 10:39:56,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:39:56,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:56,247 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:39:56,250 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:39:56,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:39:56,294 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 10:39:56,294 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 10:39:56,294 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 10:39:56,294 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 10:39:56,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:39:56,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:39:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:39:56,298 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:39:56,480 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:39:56,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:39:56,611 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:39:56,612 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:39:56,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:39:56,703 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:39:56,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:56 BoogieIcfgContainer [2024-11-10 10:39:56,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:39:56,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:39:56,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:39:56,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:39:56,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:39:55" (1/3) ... [2024-11-10 10:39:56,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56178db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:56, skipping insertion in model container [2024-11-10 10:39:56,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:56" (2/3) ... [2024-11-10 10:39:56,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56178db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:56, skipping insertion in model container [2024-11-10 10:39:56,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:56" (3/3) ... [2024-11-10 10:39:56,718 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-10 10:39:56,735 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:39:56,735 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:39:56,735 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:39:56,788 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:39:56,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 36 transitions, 86 flow [2024-11-10 10:39:56,865 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2024-11-10 10:39:56,865 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:39:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 6/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-10 10:39:56,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 36 transitions, 86 flow [2024-11-10 10:39:56,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 73 flow [2024-11-10 10:39:56,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:39:56,902 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;@610ab38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:39:56,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:39:56,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:39:56,914 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2024-11-10 10:39:56,914 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:39:56,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:56,915 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:56,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:39:56,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1444112866, now seen corresponding path program 1 times [2024-11-10 10:39:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167925441] [2024-11-10 10:39:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:57,116 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:39:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167925441] [2024-11-10 10:39:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167925441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:57,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:39:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866056035] [2024-11-10 10:39:57,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:57,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:39:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:39:57,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:39:57,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-10 10:39:57,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:39:57,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:57,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-10 10:39:57,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:57,306 INFO L124 PetriNetUnfolderBase]: 169/362 cut-off events. [2024-11-10 10:39:57,306 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-10 10:39:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 362 events. 169/362 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1535 event pairs, 138 based on Foata normal form. 62/411 useless extension candidates. Maximal degree in co-relation 633. Up to 290 conditions per place. [2024-11-10 10:39:57,319 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 20 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2024-11-10 10:39:57,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 105 flow [2024-11-10 10:39:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:39:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:39:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2024-11-10 10:39:57,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-10 10:39:57,336 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 73 flow. Second operand 2 states and 44 transitions. [2024-11-10 10:39:57,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 105 flow [2024-11-10 10:39:57,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:39:57,341 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 60 flow [2024-11-10 10:39:57,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2024-11-10 10:39:57,349 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2024-11-10 10:39:57,350 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 60 flow [2024-11-10 10:39:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:39:57,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:57,351 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:57,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:39:57,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:39:57,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1818810769, now seen corresponding path program 1 times [2024-11-10 10:39:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336024949] [2024-11-10 10:39:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:57,564 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:39:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336024949] [2024-11-10 10:39:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336024949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:57,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:57,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:39:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499270752] [2024-11-10 10:39:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:39:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:39:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:39:57,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-11-10 10:39:57,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 60 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:39:57,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:57,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-11-10 10:39:57,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:57,847 INFO L124 PetriNetUnfolderBase]: 325/682 cut-off events. [2024-11-10 10:39:57,847 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:39:57,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 682 events. 325/682 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3503 event pairs, 83 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 1253. Up to 251 conditions per place. [2024-11-10 10:39:57,856 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 58 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2024-11-10 10:39:57,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 73 transitions, 289 flow [2024-11-10 10:39:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:39:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:39:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-11-10 10:39:57,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5198412698412699 [2024-11-10 10:39:57,860 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 60 flow. Second operand 7 states and 131 transitions. [2024-11-10 10:39:57,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 73 transitions, 289 flow [2024-11-10 10:39:57,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 73 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:39:57,864 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 109 flow [2024-11-10 10:39:57,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2024-11-10 10:39:57,865 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2024-11-10 10:39:57,866 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 109 flow [2024-11-10 10:39:57,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:39:57,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:57,866 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:57,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:39:57,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:39:57,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 199358988, now seen corresponding path program 1 times [2024-11-10 10:39:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:57,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968091171] [2024-11-10 10:39:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:57,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968091171] [2024-11-10 10:39:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968091171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:39:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463081749] [2024-11-10 10:39:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:58,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:39:58,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:39:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:58,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 10:39:58,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:39:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:58,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:39:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463081749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:39:58,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:39:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 10:39:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957100036] [2024-11-10 10:39:58,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:39:58,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:39:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:39:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:39:58,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-11-10 10:39:58,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:39:58,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:58,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-11-10 10:39:58,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:58,810 INFO L124 PetriNetUnfolderBase]: 569/1165 cut-off events. [2024-11-10 10:39:58,810 INFO L125 PetriNetUnfolderBase]: For 384/440 co-relation queries the response was YES. [2024-11-10 10:39:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 1165 events. 569/1165 cut-off events. For 384/440 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6847 event pairs, 89 based on Foata normal form. 4/1120 useless extension candidates. Maximal degree in co-relation 2546. Up to 399 conditions per place. [2024-11-10 10:39:58,820 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 75 selfloop transitions, 14 changer transitions 3/99 dead transitions. [2024-11-10 10:39:58,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 99 transitions, 458 flow [2024-11-10 10:39:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:39:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:39:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-11-10 10:39:58,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2024-11-10 10:39:58,824 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 109 flow. Second operand 9 states and 170 transitions. [2024-11-10 10:39:58,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 99 transitions, 458 flow [2024-11-10 10:39:58,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 99 transitions, 448 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:39:58,834 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 168 flow [2024-11-10 10:39:58,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=168, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-11-10 10:39:58,836 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2024-11-10 10:39:58,836 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 168 flow [2024-11-10 10:39:58,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:39:58,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:58,836 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:58,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:39:59,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:59,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:39:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1947096694, now seen corresponding path program 1 times [2024-11-10 10:39:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818216311] [2024-11-10 10:39:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:59,139 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:39:59,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:59,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818216311] [2024-11-10 10:39:59,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818216311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:59,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:59,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:39:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17106945] [2024-11-10 10:39:59,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:59,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:39:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:39:59,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:39:59,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-11-10 10:39:59,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:39:59,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:59,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-11-10 10:39:59,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:59,391 INFO L124 PetriNetUnfolderBase]: 632/1327 cut-off events. [2024-11-10 10:39:59,392 INFO L125 PetriNetUnfolderBase]: For 1375/1541 co-relation queries the response was YES. [2024-11-10 10:39:59,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 1327 events. 632/1327 cut-off events. For 1375/1541 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8265 event pairs, 175 based on Foata normal form. 12/1272 useless extension candidates. Maximal degree in co-relation 3299. Up to 498 conditions per place. [2024-11-10 10:39:59,402 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 79 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2024-11-10 10:39:59,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 630 flow [2024-11-10 10:39:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:39:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:39:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-11-10 10:39:59,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-11-10 10:39:59,405 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 168 flow. Second operand 7 states and 128 transitions. [2024-11-10 10:39:59,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 630 flow [2024-11-10 10:39:59,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:39:59,416 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 224 flow [2024-11-10 10:39:59,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-10 10:39:59,418 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2024-11-10 10:39:59,418 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 224 flow [2024-11-10 10:39:59,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:39:59,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:59,419 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:39:59,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:39:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1953134753, now seen corresponding path program 1 times [2024-11-10 10:39:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231461631] [2024-11-10 10:39:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:59,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:59,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231461631] [2024-11-10 10:39:59,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231461631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:59,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:59,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:39:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765513641] [2024-11-10 10:39:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:59,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:39:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:39:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:39:59,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-11-10 10:39:59,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:39:59,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:59,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-11-10 10:39:59,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:59,752 INFO L124 PetriNetUnfolderBase]: 583/1261 cut-off events. [2024-11-10 10:39:59,753 INFO L125 PetriNetUnfolderBase]: For 1724/1762 co-relation queries the response was YES. [2024-11-10 10:39:59,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1261 events. 583/1261 cut-off events. For 1724/1762 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7700 event pairs, 124 based on Foata normal form. 12/1262 useless extension candidates. Maximal degree in co-relation 3583. Up to 435 conditions per place. [2024-11-10 10:39:59,762 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 62 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2024-11-10 10:39:59,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 531 flow [2024-11-10 10:39:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:39:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:39:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-11-10 10:39:59,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 10:39:59,764 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 224 flow. Second operand 6 states and 108 transitions. [2024-11-10 10:39:59,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 531 flow [2024-11-10 10:39:59,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 522 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:39:59,772 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 229 flow [2024-11-10 10:39:59,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-10 10:39:59,773 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2024-11-10 10:39:59,774 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 229 flow [2024-11-10 10:39:59,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:39:59,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:59,774 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:59,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:39:59,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:39:59,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1739095161, now seen corresponding path program 1 times [2024-11-10 10:39:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:59,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595820695] [2024-11-10 10:39:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:59,847 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:39:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595820695] [2024-11-10 10:39:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595820695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:39:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740693686] [2024-11-10 10:39:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:39:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:59,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:39:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:39:59,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-11-10 10:39:59,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:39:59,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:59,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-11-10 10:39:59,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:00,075 INFO L124 PetriNetUnfolderBase]: 591/1284 cut-off events. [2024-11-10 10:40:00,076 INFO L125 PetriNetUnfolderBase]: For 2044/2136 co-relation queries the response was YES. [2024-11-10 10:40:00,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 1284 events. 591/1284 cut-off events. For 2044/2136 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8012 event pairs, 20 based on Foata normal form. 8/1246 useless extension candidates. Maximal degree in co-relation 3800. Up to 477 conditions per place. [2024-11-10 10:40:00,116 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 67 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2024-11-10 10:40:00,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 576 flow [2024-11-10 10:40:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:40:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:40:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-11-10 10:40:00,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-11-10 10:40:00,118 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 229 flow. Second operand 6 states and 112 transitions. [2024-11-10 10:40:00,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 576 flow [2024-11-10 10:40:00,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 549 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 10:40:00,126 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 239 flow [2024-11-10 10:40:00,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-10 10:40:00,127 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2024-11-10 10:40:00,128 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 239 flow [2024-11-10 10:40:00,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:40:00,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:00,128 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:00,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:40:00,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:40:00,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1664722327, now seen corresponding path program 2 times [2024-11-10 10:40:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:00,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824706347] [2024-11-10 10:40:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:00,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824706347] [2024-11-10 10:40:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824706347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472589250] [2024-11-10 10:40:00,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:40:00,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:00,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:40:00,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:40:00,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:40:00,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:40:00,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 10:40:00,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:00,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:40:00,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472589250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:40:00,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:40:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-10 10:40:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731700566] [2024-11-10 10:40:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:40:00,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:40:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:40:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:40:00,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-10 10:40:00,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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:40:00,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:00,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-10 10:40:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:00,617 INFO L124 PetriNetUnfolderBase]: 427/1000 cut-off events. [2024-11-10 10:40:00,617 INFO L125 PetriNetUnfolderBase]: For 1846/2015 co-relation queries the response was YES. [2024-11-10 10:40:00,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2951 conditions, 1000 events. 427/1000 cut-off events. For 1846/2015 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6198 event pairs, 91 based on Foata normal form. 42/1032 useless extension candidates. Maximal degree in co-relation 2937. Up to 328 conditions per place. [2024-11-10 10:40:00,625 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 77 selfloop transitions, 13 changer transitions 6/105 dead transitions. [2024-11-10 10:40:00,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 682 flow [2024-11-10 10:40:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:40:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:40:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-11-10 10:40:00,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-11-10 10:40:00,627 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 239 flow. Second operand 10 states and 182 transitions. [2024-11-10 10:40:00,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 682 flow [2024-11-10 10:40:00,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 652 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-10 10:40:00,634 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 278 flow [2024-11-10 10:40:00,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2024-11-10 10:40:00,634 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2024-11-10 10:40:00,635 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 278 flow [2024-11-10 10:40:00,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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:40:00,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:00,635 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:00,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:40:00,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 10:40:00,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:40:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1420999181, now seen corresponding path program 1 times [2024-11-10 10:40:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367666112] [2024-11-10 10:40:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367666112] [2024-11-10 10:40:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367666112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:00,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539907798] [2024-11-10 10:40:00,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:00,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:00,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:00,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:40:00,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:40:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 10:40:00,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:01,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:40:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539907798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:40:01,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:40:01,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 10:40:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650483300] [2024-11-10 10:40:01,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:40:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:40:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:01,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:40:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:40:01,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-11-10 10:40:01,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 278 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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:40:01,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:01,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-11-10 10:40:01,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:01,433 INFO L124 PetriNetUnfolderBase]: 547/1227 cut-off events. [2024-11-10 10:40:01,434 INFO L125 PetriNetUnfolderBase]: For 2695/2768 co-relation queries the response was YES. [2024-11-10 10:40:01,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1227 events. 547/1227 cut-off events. For 2695/2768 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7699 event pairs, 162 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 3749. Up to 477 conditions per place. [2024-11-10 10:40:01,443 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 81 selfloop transitions, 15 changer transitions 1/105 dead transitions. [2024-11-10 10:40:01,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 816 flow [2024-11-10 10:40:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:40:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:40:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-11-10 10:40:01,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-11-10 10:40:01,447 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 278 flow. Second operand 9 states and 160 transitions. [2024-11-10 10:40:01,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 816 flow [2024-11-10 10:40:01,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 796 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-10 10:40:01,455 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 336 flow [2024-11-10 10:40:01,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=336, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2024-11-10 10:40:01,458 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-11-10 10:40:01,458 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 336 flow [2024-11-10 10:40:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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:40:01,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:01,459 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:01,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:40:01,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:01,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:40:01,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash -503352636, now seen corresponding path program 1 times [2024-11-10 10:40:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:01,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517990824] [2024-11-10 10:40:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:40:01,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:40:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:40:01,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:40:01,702 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:40:01,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:40:01,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-11-10 10:40:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 10:40:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-10 10:40:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-10 10:40:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:40:01,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:40:01,706 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:01,751 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:40:01,751 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:40:01,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:40:01 BasicIcfg [2024-11-10 10:40:01,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:40:01,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:40:01,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:40:01,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:40:01,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:56" (3/4) ... [2024-11-10 10:40:01,761 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:40:01,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:40:01,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:40:01,816 INFO L158 Benchmark]: Toolchain (without parser) took 6266.39ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 127.5MB in the beginning and 84.7MB in the end (delta: 42.9MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,816 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:40:01,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.65ms. Allocated memory is still 159.4MB. Free memory was 127.5MB in the beginning and 104.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.63ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,817 INFO L158 Benchmark]: Boogie Preprocessor took 58.65ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,821 INFO L158 Benchmark]: IcfgBuilder took 498.00ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 112.9MB in the end (delta: -12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,822 INFO L158 Benchmark]: TraceAbstraction took 5046.93ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 111.8MB in the beginning and 87.8MB in the end (delta: 24.0MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,822 INFO L158 Benchmark]: Witness Printer took 58.04ms. Allocated memory is still 192.9MB. Free memory was 87.8MB in the beginning and 84.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:40:01,823 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.20ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.65ms. Allocated memory is still 159.4MB. Free memory was 127.5MB in the beginning and 104.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.63ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.65ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 498.00ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 112.9MB in the end (delta: -12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5046.93ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 111.8MB in the beginning and 87.8MB in the end (delta: 24.0MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Witness Printer took 58.04ms. Allocated memory is still 192.9MB. Free memory was 87.8MB in the beginning and 84.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=1, expression=0, limit=1] [L753] 2 reach_error() VAL [\old(expression)=0, _N=1, expression=0, limit=1] - UnprovableResult [Line: 778]: 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: 779]: 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: 753]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 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: 4.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 680 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1269 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13 mSDtfsCounter, 1269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=8, InterpolantAutomatonStates: 56, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 497 SizeOfPredicates, 12 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 10/24 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:40:01,849 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