./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.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/unwind1-100.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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:39:48,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:39:48,639 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:48,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:39:48,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:39:48,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:39:48,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:39:48,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:39:48,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:39:48,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:39:48,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:39:48,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:39:48,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:39:48,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:39:48,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:39:48,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:39:48,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:39:48,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:39:48,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:39:48,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:39:48,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:39:48,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:39:48,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:39:48,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:39:48,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:39:48,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:39:48,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:39:48,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:39:48,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:39:48,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:39:48,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:39:48,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:39:48,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:39:48,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:39:48,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:39:48,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:39:48,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:39:48,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:39:48,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:39:48,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:39:48,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:39:48,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:39:48,681 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-10 10:39:48,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:39:48,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:39:48,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:39:48,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:39:48,978 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:39:48,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-10 10:39:50,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:39:50,724 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:39:50,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-10 10:39:50,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6332b91f0/30e568e492be45609068c6f34e951880/FLAG0829fd0c8 [2024-11-10 10:39:50,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6332b91f0/30e568e492be45609068c6f34e951880 [2024-11-10 10:39:50,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:39:50,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:39:50,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:39:50,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:39:50,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:39:50,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:50" (1/1) ... [2024-11-10 10:39:50,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2226111f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:50, skipping insertion in model container [2024-11-10 10:39:50,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:50" (1/1) ... [2024-11-10 10:39:50,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:39:51,184 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/unwind1-100.i[33026,33039] [2024-11-10 10:39:51,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:39:51,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:39:51,274 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/unwind1-100.i[33026,33039] [2024-11-10 10:39:51,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:39:51,336 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:39:51,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:51 WrapperNode [2024-11-10 10:39:51,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:39:51,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:39:51,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:39:51,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:39:51,344 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:51" (1/1) ... [2024-11-10 10:39:51,362 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:51" (1/1) ... [2024-11-10 10:39:51,381 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-10 10:39:51,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:39:51,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:39:51,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:39:51,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:39:51,392 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:51" (1/1) ... [2024-11-10 10:39:51,393 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:51" (1/1) ... [2024-11-10 10:39:51,395 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:51" (1/1) ... [2024-11-10 10:39:51,407 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:51,407 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:51" (1/1) ... [2024-11-10 10:39:51,408 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:51" (1/1) ... [2024-11-10 10:39:51,413 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:51" (1/1) ... [2024-11-10 10:39:51,417 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:51" (1/1) ... [2024-11-10 10:39:51,419 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:51" (1/1) ... [2024-11-10 10:39:51,420 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:51" (1/1) ... [2024-11-10 10:39:51,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:39:51,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:39:51,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:39:51,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:39:51,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:51" (1/1) ... [2024-11-10 10:39:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:39:51,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:51,469 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:51,473 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:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:39:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 10:39:51,524 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 10:39:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 10:39:51,525 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 10:39:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:39:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:39:51,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:39:51,528 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:51,697 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:39:51,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:39:51,816 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:39:51,818 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:39:51,954 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:39:51,954 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:39:51,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:51 BoogieIcfgContainer [2024-11-10 10:39:51,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:39:51,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:39:51,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:39:51,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:39:51,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:39:50" (1/3) ... [2024-11-10 10:39:51,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd26f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:51, skipping insertion in model container [2024-11-10 10:39:51,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:51" (2/3) ... [2024-11-10 10:39:51,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd26f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:51, skipping insertion in model container [2024-11-10 10:39:51,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:51" (3/3) ... [2024-11-10 10:39:51,967 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-10 10:39:51,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:39:51,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:39:51,987 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:39:52,050 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:39:52,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2024-11-10 10:39:52,127 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-11-10 10:39:52,129 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:39:52,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-10 10:39:52,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2024-11-10 10:39:52,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 55 flow [2024-11-10 10:39:52,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:39:52,157 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;@7b8856f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:39:52,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:39:52,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:39:52,169 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-10 10:39:52,169 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:39:52,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:52,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:52,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:52,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1750081885, now seen corresponding path program 1 times [2024-11-10 10:39:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043233847] [2024-11-10 10:39:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:52,377 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:52,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043233847] [2024-11-10 10:39:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043233847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:39:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901333416] [2024-11-10 10:39:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:52,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:39:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:52,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:39:52,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:39:52,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-11-10 10:39:52,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 55 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-11-10 10:39:52,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:52,548 INFO L124 PetriNetUnfolderBase]: 108/228 cut-off events. [2024-11-10 10:39:52,549 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 10:39:52,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 228 events. 108/228 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 845 event pairs, 83 based on Foata normal form. 26/235 useless extension candidates. Maximal degree in co-relation 402. Up to 187 conditions per place. [2024-11-10 10:39:52,554 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 16 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2024-11-10 10:39:52,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 85 flow [2024-11-10 10:39:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:39:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:39:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2024-11-10 10:39:52,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-10 10:39:52,568 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 55 flow. Second operand 2 states and 31 transitions. [2024-11-10 10:39:52,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 85 flow [2024-11-10 10:39:52,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:39:52,573 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 44 flow [2024-11-10 10:39:52,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2024-11-10 10:39:52,580 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2024-11-10 10:39:52,582 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 44 flow [2024-11-10 10:39:52,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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:52,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:52,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:39:52,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:52,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1581051497, now seen corresponding path program 1 times [2024-11-10 10:39:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296698724] [2024-11-10 10:39:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:52,848 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:52,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:52,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296698724] [2024-11-10 10:39:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296698724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:39:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107784369] [2024-11-10 10:39:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:52,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:39:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:39:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:39:52,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-11-10 10:39:52,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:52,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:52,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-11-10 10:39:52,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:53,037 INFO L124 PetriNetUnfolderBase]: 165/341 cut-off events. [2024-11-10 10:39:53,037 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 10:39:53,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 341 events. 165/341 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1378 event pairs, 66 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 636. Up to 154 conditions per place. [2024-11-10 10:39:53,042 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 22 selfloop transitions, 3 changer transitions 19/47 dead transitions. [2024-11-10 10:39:53,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 47 transitions, 189 flow [2024-11-10 10:39:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:39:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:39:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-11-10 10:39:53,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-11-10 10:39:53,046 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 44 flow. Second operand 6 states and 75 transitions. [2024-11-10 10:39:53,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 47 transitions, 189 flow [2024-11-10 10:39:53,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 189 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:39:53,049 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 58 flow [2024-11-10 10:39:53,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2024-11-10 10:39:53,052 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2024-11-10 10:39:53,052 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 58 flow [2024-11-10 10:39:53,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:53,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:53,054 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:39:53,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1003116698, now seen corresponding path program 1 times [2024-11-10 10:39:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629664524] [2024-11-10 10:39:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629664524] [2024-11-10 10:39:53,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629664524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:39:53,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:39:53,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:39:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731720346] [2024-11-10 10:39:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:39:53,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:39:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:39:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:39:53,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-11-10 10:39:53,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:53,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:53,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-11-10 10:39:53,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:53,261 INFO L124 PetriNetUnfolderBase]: 58/154 cut-off events. [2024-11-10 10:39:53,263 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-10 10:39:53,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 154 events. 58/154 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 530 event pairs, 21 based on Foata normal form. 13/160 useless extension candidates. Maximal degree in co-relation 323. Up to 65 conditions per place. [2024-11-10 10:39:53,266 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 17 selfloop transitions, 3 changer transitions 10/33 dead transitions. [2024-11-10 10:39:53,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 150 flow [2024-11-10 10:39:53,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:39:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:39:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-11-10 10:39:53,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-11-10 10:39:53,268 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 58 flow. Second operand 5 states and 61 transitions. [2024-11-10 10:39:53,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 150 flow [2024-11-10 10:39:53,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 143 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-10 10:39:53,270 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2024-11-10 10:39:53,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2024-11-10 10:39:53,271 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2024-11-10 10:39:53,272 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2024-11-10 10:39:53,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:53,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:53,272 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:53,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:39:53,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1287121078, now seen corresponding path program 1 times [2024-11-10 10:39:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115307743] [2024-11-10 10:39:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:53,420 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:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:53,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115307743] [2024-11-10 10:39:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115307743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:39:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730437874] [2024-11-10 10:39:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:53,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:53,424 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:53,425 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:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:53,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:39:53,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:39:53,619 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:53,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:39:53,699 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:53,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730437874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:39:53,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:39:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-10 10:39:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143675536] [2024-11-10 10:39:53,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:39:53,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:39:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:53,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:39:53,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:39:53,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2024-11-10 10:39:53,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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:53,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:53,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2024-11-10 10:39:53,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:53,991 INFO L124 PetriNetUnfolderBase]: 64/159 cut-off events. [2024-11-10 10:39:53,993 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-10 10:39:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 159 events. 64/159 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 21 based on Foata normal form. 20/175 useless extension candidates. Maximal degree in co-relation 369. Up to 64 conditions per place. [2024-11-10 10:39:53,996 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 28 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2024-11-10 10:39:53,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 187 flow [2024-11-10 10:39:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:39:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:39:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2024-11-10 10:39:53,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-11-10 10:39:53,999 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 8 states and 72 transitions. [2024-11-10 10:39:53,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 187 flow [2024-11-10 10:39:54,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 175 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 10:39:54,001 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 101 flow [2024-11-10 10:39:54,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2024-11-10 10:39:54,001 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2024-11-10 10:39:54,002 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 101 flow [2024-11-10 10:39:54,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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:54,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:54,002 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:54,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 10:39:54,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:54,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1393601, now seen corresponding path program 2 times [2024-11-10 10:39:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093319692] [2024-11-10 10:39:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:39:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093319692] [2024-11-10 10:39:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093319692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:39:54,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195946992] [2024-11-10 10:39:54,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:39:54,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:54,318 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:39:54,320 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:39:54,382 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:39:54,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:39:54,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 10:39:54,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:39:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:54,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:39:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195946992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:39:54,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:39:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-11-10 10:39:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528906924] [2024-11-10 10:39:54,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:39:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 10:39:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 10:39:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 10:39:54,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2024-11-10 10:39:54,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 101 flow. Second operand has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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:54,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:54,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2024-11-10 10:39:54,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:55,551 INFO L124 PetriNetUnfolderBase]: 271/655 cut-off events. [2024-11-10 10:39:55,552 INFO L125 PetriNetUnfolderBase]: For 1186/1186 co-relation queries the response was YES. [2024-11-10 10:39:55,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 655 events. 271/655 cut-off events. For 1186/1186 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2833 event pairs, 27 based on Foata normal form. 60/711 useless extension candidates. Maximal degree in co-relation 1775. Up to 115 conditions per place. [2024-11-10 10:39:55,556 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 45 selfloop transitions, 13 changer transitions 123/183 dead transitions. [2024-11-10 10:39:55,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 183 transitions, 998 flow [2024-11-10 10:39:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-10 10:39:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2024-11-10 10:39:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 361 transitions. [2024-11-10 10:39:55,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.318342151675485 [2024-11-10 10:39:55,560 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 101 flow. Second operand 42 states and 361 transitions. [2024-11-10 10:39:55,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 183 transitions, 998 flow [2024-11-10 10:39:55,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 183 transitions, 941 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-11-10 10:39:55,571 INFO L231 Difference]: Finished difference. Result has 102 places, 27 transitions, 199 flow [2024-11-10 10:39:55,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=199, PETRI_PLACES=102, PETRI_TRANSITIONS=27} [2024-11-10 10:39:55,574 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 76 predicate places. [2024-11-10 10:39:55,574 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 27 transitions, 199 flow [2024-11-10 10:39:55,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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:55,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:55,575 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:55,592 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:39:55,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:55,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 810230321, now seen corresponding path program 1 times [2024-11-10 10:39:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865066028] [2024-11-10 10:39:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865066028] [2024-11-10 10:39:56,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865066028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:39:56,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658332404] [2024-11-10 10:39:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:56,038 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:39:56,040 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:39:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:56,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 10:39:56,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:39:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:56,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:39:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658332404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:39:56,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:39:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2024-11-10 10:39:56,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579225797] [2024-11-10 10:39:56,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:39:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 10:39:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 10:39:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 10:39:56,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-11-10 10:39:56,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 27 transitions, 199 flow. Second operand has 39 states, 39 states have (on average 6.333333333333333) internal successors, (247), 39 states have internal predecessors, (247), 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:56,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:56,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-11-10 10:39:56,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:39:57,381 INFO L124 PetriNetUnfolderBase]: 147/418 cut-off events. [2024-11-10 10:39:57,382 INFO L125 PetriNetUnfolderBase]: For 4775/4775 co-relation queries the response was YES. [2024-11-10 10:39:57,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 418 events. 147/418 cut-off events. For 4775/4775 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1121 event pairs, 18 based on Foata normal form. 60/478 useless extension candidates. Maximal degree in co-relation 1197. Up to 120 conditions per place. [2024-11-10 10:39:57,386 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 81 selfloop transitions, 25 changer transitions 0/108 dead transitions. [2024-11-10 10:39:57,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 108 transitions, 645 flow [2024-11-10 10:39:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 10:39:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-10 10:39:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 248 transitions. [2024-11-10 10:39:57,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35327635327635326 [2024-11-10 10:39:57,388 INFO L175 Difference]: Start difference. First operand has 102 places, 27 transitions, 199 flow. Second operand 26 states and 248 transitions. [2024-11-10 10:39:57,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 108 transitions, 645 flow [2024-11-10 10:39:57,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 545 flow, removed 43 selfloop flow, removed 31 redundant places. [2024-11-10 10:39:57,396 INFO L231 Difference]: Finished difference. Result has 79 places, 39 transitions, 271 flow [2024-11-10 10:39:57,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=271, PETRI_PLACES=79, PETRI_TRANSITIONS=39} [2024-11-10 10:39:57,397 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 53 predicate places. [2024-11-10 10:39:57,397 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 39 transitions, 271 flow [2024-11-10 10:39:57,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.333333333333333) internal successors, (247), 39 states have internal predecessors, (247), 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,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:57,398 INFO L204 CegarLoopForPetriNet]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:57,416 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:39:57,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:57,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash -757969011, now seen corresponding path program 2 times [2024-11-10 10:39:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639522147] [2024-11-10 10:39:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:57,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:58,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639522147] [2024-11-10 10:39:58,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639522147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:39:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808214987] [2024-11-10 10:39:58,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:39:58,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:58,245 INFO L229 MonitoredProcess]: Starting monitored process 5 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,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:39:58,318 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:39:58,319 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:39:58,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 10:39:58,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:39:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:58,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:39:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:39:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808214987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:39:59,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:39:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 74 [2024-11-10 10:39:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359614770] [2024-11-10 10:39:59,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:39:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-10 10:39:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:39:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-10 10:39:59,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2264, Invalid=3286, Unknown=0, NotChecked=0, Total=5550 [2024-11-10 10:39:59,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-11-10 10:39:59,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 39 transitions, 271 flow. Second operand has 75 states, 75 states have (on average 6.173333333333333) internal successors, (463), 75 states have internal predecessors, (463), 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,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:39:59,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-11-10 10:39:59,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:01,710 INFO L124 PetriNetUnfolderBase]: 267/778 cut-off events. [2024-11-10 10:40:01,711 INFO L125 PetriNetUnfolderBase]: For 32717/32717 co-relation queries the response was YES. [2024-11-10 10:40:01,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 778 events. 267/778 cut-off events. For 32717/32717 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2129 event pairs, 18 based on Foata normal form. 120/898 useless extension candidates. Maximal degree in co-relation 2037. Up to 240 conditions per place. [2024-11-10 10:40:01,718 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 153 selfloop transitions, 49 changer transitions 0/204 dead transitions. [2024-11-10 10:40:01,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 204 transitions, 1149 flow [2024-11-10 10:40:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-10 10:40:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-10 10:40:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 476 transitions. [2024-11-10 10:40:01,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35259259259259257 [2024-11-10 10:40:01,726 INFO L175 Difference]: Start difference. First operand has 79 places, 39 transitions, 271 flow. Second operand 50 states and 476 transitions. [2024-11-10 10:40:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 204 transitions, 1149 flow [2024-11-10 10:40:01,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 204 transitions, 1049 flow, removed 37 selfloop flow, removed 13 redundant places. [2024-11-10 10:40:01,740 INFO L231 Difference]: Finished difference. Result has 139 places, 63 transitions, 511 flow [2024-11-10 10:40:01,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=511, PETRI_PLACES=139, PETRI_TRANSITIONS=63} [2024-11-10 10:40:01,743 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 113 predicate places. [2024-11-10 10:40:01,743 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 63 transitions, 511 flow [2024-11-10 10:40:01,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 6.173333333333333) internal successors, (463), 75 states have internal predecessors, (463), 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,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:01,748 INFO L204 CegarLoopForPetriNet]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:01,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 10:40:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:01,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:40:01,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash -313872827, now seen corresponding path program 3 times [2024-11-10 10:40:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:01,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336391883] [2024-11-10 10:40:01,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336391883] [2024-11-10 10:40:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336391883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111967056] [2024-11-10 10:40:03,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 10:40:03,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:03,699 INFO L229 MonitoredProcess]: Starting monitored process 6 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:03,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 10:40:03,813 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2024-11-10 10:40:03,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:40:03,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 10:40:03,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:05,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:40:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111967056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:40:07,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:40:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 146 [2024-11-10 10:40:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40777641] [2024-11-10 10:40:07,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:40:07,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2024-11-10 10:40:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:07,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2024-11-10 10:40:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9128, Invalid=12334, Unknown=0, NotChecked=0, Total=21462 [2024-11-10 10:40:07,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-11-10 10:40:07,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 63 transitions, 511 flow. Second operand has 147 states, 147 states have (on average 6.08843537414966) internal successors, (895), 147 states have internal predecessors, (895), 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:07,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:07,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-11-10 10:40:07,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:13,640 INFO L124 PetriNetUnfolderBase]: 507/1498 cut-off events. [2024-11-10 10:40:13,641 INFO L125 PetriNetUnfolderBase]: For 267065/267065 co-relation queries the response was YES. [2024-11-10 10:40:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 1498 events. 507/1498 cut-off events. For 267065/267065 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4050 event pairs, 18 based on Foata normal form. 240/1738 useless extension candidates. Maximal degree in co-relation 3957. Up to 480 conditions per place. [2024-11-10 10:40:13,655 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 297 selfloop transitions, 97 changer transitions 0/396 dead transitions. [2024-11-10 10:40:13,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 396 transitions, 2253 flow [2024-11-10 10:40:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-10 10:40:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-10 10:40:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 932 transitions. [2024-11-10 10:40:13,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35222978080120937 [2024-11-10 10:40:13,661 INFO L175 Difference]: Start difference. First operand has 139 places, 63 transitions, 511 flow. Second operand 98 states and 932 transitions. [2024-11-10 10:40:13,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 396 transitions, 2253 flow [2024-11-10 10:40:13,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 396 transitions, 2057 flow, removed 73 selfloop flow, removed 25 redundant places. [2024-11-10 10:40:13,724 INFO L231 Difference]: Finished difference. Result has 259 places, 111 transitions, 991 flow [2024-11-10 10:40:13,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=991, PETRI_PLACES=259, PETRI_TRANSITIONS=111} [2024-11-10 10:40:13,727 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 233 predicate places. [2024-11-10 10:40:13,727 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 111 transitions, 991 flow [2024-11-10 10:40:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 6.08843537414966) internal successors, (895), 147 states have internal predecessors, (895), 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:13,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:13,728 INFO L204 CegarLoopForPetriNet]: trace histogram [95, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:13,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 10:40:13,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:13,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:40:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1953725365, now seen corresponding path program 4 times [2024-11-10 10:40:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074224409] [2024-11-10 10:40:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074224409] [2024-11-10 10:40:19,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074224409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597184870] [2024-11-10 10:40:19,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 10:40:19,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:19,480 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 10:40:19,627 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 10:40:19,627 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:40:19,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-10 10:40:19,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:23,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:40:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597184870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:40:28,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:40:28,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2024-11-10 10:40:28,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987548125] [2024-11-10 10:40:28,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:40:28,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2024-11-10 10:40:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2024-11-10 10:40:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15142, Invalid=25460, Unknown=0, NotChecked=0, Total=40602 [2024-11-10 10:40:28,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-11-10 10:40:28,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 111 transitions, 991 flow. Second operand has 202 states, 202 states have (on average 6.069306930693069) internal successors, (1226), 202 states have internal predecessors, (1226), 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:28,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:28,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-11-10 10:40:28,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:36,514 INFO L124 PetriNetUnfolderBase]: 542/1603 cut-off events. [2024-11-10 10:40:36,514 INFO L125 PetriNetUnfolderBase]: For 181652/181652 co-relation queries the response was YES. [2024-11-10 10:40:36,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 1603 events. 542/1603 cut-off events. For 181652/181652 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4440 event pairs, 18 based on Foata normal form. 35/1638 useless extension candidates. Maximal degree in co-relation 4682. Up to 515 conditions per place. [2024-11-10 10:40:36,536 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 318 selfloop transitions, 104 changer transitions 0/424 dead transitions. [2024-11-10 10:40:36,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 424 transitions, 2592 flow [2024-11-10 10:40:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-10 10:40:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-10 10:40:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 954 transitions. [2024-11-10 10:40:36,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33650793650793653 [2024-11-10 10:40:36,544 INFO L175 Difference]: Start difference. First operand has 259 places, 111 transitions, 991 flow. Second operand 105 states and 954 transitions. [2024-11-10 10:40:36,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 424 transitions, 2592 flow [2024-11-10 10:40:36,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 424 transitions, 2382 flow, removed 56 selfloop flow, removed 49 redundant places. [2024-11-10 10:40:36,723 INFO L231 Difference]: Finished difference. Result has 321 places, 118 transitions, 1061 flow [2024-11-10 10:40:36,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=1061, PETRI_PLACES=321, PETRI_TRANSITIONS=118} [2024-11-10 10:40:36,724 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 295 predicate places. [2024-11-10 10:40:36,724 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 118 transitions, 1061 flow [2024-11-10 10:40:36,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 6.069306930693069) internal successors, (1226), 202 states have internal predecessors, (1226), 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:36,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:36,725 INFO L204 CegarLoopForPetriNet]: trace histogram [102, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:36,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 10:40:36,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:36,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:40:36,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1310759264, now seen corresponding path program 5 times [2024-11-10 10:40:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:36,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37614475] [2024-11-10 10:40:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:40:37,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:40:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:40:37,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:40:37,143 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:40:37,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-10 10:40:37,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-10 10:40:37,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-10 10:40:37,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:40:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:40:37,150 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2024-11-10 10:40:37,302 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:40:37,302 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:40:37,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:40:37 BasicIcfg [2024-11-10 10:40:37,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:40:37,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:40:37,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:40:37,308 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:40:37,308 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:51" (3/4) ... [2024-11-10 10:40:37,309 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:40:37,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:40:37,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:40:37,408 INFO L158 Benchmark]: Toolchain (without parser) took 46651.00ms. Allocated memory was 176.2MB in the beginning and 922.7MB in the end (delta: 746.6MB). Free memory was 122.8MB in the beginning and 552.8MB in the end (delta: -430.1MB). Peak memory consumption was 318.5MB. Max. memory is 16.1GB. [2024-11-10 10:40:37,409 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:40:37,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.00ms. Allocated memory is still 176.2MB. Free memory was 122.2MB in the beginning and 99.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:37,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 176.2MB. Free memory was 99.1MB in the beginning and 97.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:37,411 INFO L158 Benchmark]: Boogie Preprocessor took 40.87ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 95.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:40:37,412 INFO L158 Benchmark]: IcfgBuilder took 530.43ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 95.4MB in the beginning and 184.1MB in the end (delta: -88.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-10 10:40:37,412 INFO L158 Benchmark]: TraceAbstraction took 45349.50ms. Allocated memory was 220.2MB in the beginning and 922.7MB in the end (delta: 702.5MB). Free memory was 183.0MB in the beginning and 578.0MB in the end (delta: -395.0MB). Peak memory consumption was 307.6MB. Max. memory is 16.1GB. [2024-11-10 10:40:37,412 INFO L158 Benchmark]: Witness Printer took 100.56ms. Allocated memory is still 922.7MB. Free memory was 578.0MB in the beginning and 552.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 10:40:37,414 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.10ms. Allocated memory is still 176.2MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.00ms. Allocated memory is still 176.2MB. Free memory was 122.2MB in the beginning and 99.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 176.2MB. Free memory was 99.1MB in the beginning and 97.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.87ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 95.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 530.43ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 95.4MB in the beginning and 184.1MB in the end (delta: -88.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45349.50ms. Allocated memory was 220.2MB in the beginning and 922.7MB in the end (delta: 702.5MB). Free memory was 183.0MB in the beginning and 578.0MB in the end (delta: -395.0MB). Peak memory consumption was 307.6MB. Max. memory is 16.1GB. * Witness Printer took 100.56ms. Allocated memory is still 922.7MB. Free memory was 578.0MB in the beginning and 552.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.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; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] - UnprovableResult [Line: 776]: 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: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 41 locations, 4 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: 45.1s, OverallIterations: 10, TraceHistogramMax: 102, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5605 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5602 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2402 IncrementalHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 5 mSDtfsCounter, 2402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 484 SyntacticMatches, 91 SemanticMatches, 797 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67240 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1061occurred in iteration=9, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1306 ConstructedInterpolants, 0 QuantifiedInterpolants, 6709 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1180 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 14/35192 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:37,450 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