./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:39:56,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:39:56,846 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:56,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:39:56,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:39:56,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:39:56,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:39:56,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:39:56,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:39:56,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:39:56,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:39:56,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:39:56,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:39:56,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:39:56,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:39:56,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:39:56,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:39:56,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:39:56,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:39:56,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:39:56,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:39:56,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:39:56,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:39:56,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:39:56,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:39:56,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:39:56,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:39:56,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:39:56,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:39:56,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:39:56,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:39:56,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:39:56,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:39:56,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:39:56,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:39:56,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:39:56,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:39:56,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:39:56,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:39:56,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:39:56,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:39:56,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:39:56,883 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2024-11-10 10:39:57,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:39:57,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:39:57,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:39:57,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:39:57,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:39:57,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-10 10:39:58,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:39:58,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:39:58,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-10 10:39:58,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339983956/245c0558fdc642ea8fb4a9b9190b4679/FLAGa450097f1 [2024-11-10 10:39:58,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339983956/245c0558fdc642ea8fb4a9b9190b4679 [2024-11-10 10:39:58,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:39:58,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:39:58,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:39:58,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:39:58,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:39:58,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:58" (1/1) ... [2024-11-10 10:39:58,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276218c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:58, skipping insertion in model container [2024-11-10 10:39:58,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:58" (1/1) ... [2024-11-10 10:39:58,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:39:59,227 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/unwind3-1.i[33026,33039] [2024-11-10 10:39:59,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:39:59,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:39:59,280 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/unwind3-1.i[33026,33039] [2024-11-10 10:39:59,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:39:59,316 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:39:59,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:59 WrapperNode [2024-11-10 10:39:59,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:39:59,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:39:59,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:39:59,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:39:59,322 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:59" (1/1) ... [2024-11-10 10:39:59,333 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:59" (1/1) ... [2024-11-10 10:39:59,349 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-10 10:39:59,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:39:59,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:39:59,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:39:59,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:39:59,357 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:59" (1/1) ... [2024-11-10 10:39:59,357 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:59" (1/1) ... [2024-11-10 10:39:59,359 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:59" (1/1) ... [2024-11-10 10:39:59,367 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:59,367 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:59" (1/1) ... [2024-11-10 10:39:59,367 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:59" (1/1) ... [2024-11-10 10:39:59,370 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:59" (1/1) ... [2024-11-10 10:39:59,371 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:59" (1/1) ... [2024-11-10 10:39:59,372 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:59" (1/1) ... [2024-11-10 10:39:59,372 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:59" (1/1) ... [2024-11-10 10:39:59,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:39:59,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:39:59,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:39:59,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:39:59,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:59" (1/1) ... [2024-11-10 10:39:59,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:39:59,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:59,409 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:59,411 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:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:39:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 10:39:59,447 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 10:39:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 10:39:59,448 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 10:39:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:39:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:39:59,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:39:59,450 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:59,550 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:39:59,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:39:59,641 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:39:59,642 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:39:59,709 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:39:59,709 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:39:59,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:59 BoogieIcfgContainer [2024-11-10 10:39:59,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:39:59,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:39:59,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:39:59,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:39:59,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:39:58" (1/3) ... [2024-11-10 10:39:59,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7503a0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:59, skipping insertion in model container [2024-11-10 10:39:59,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:59" (2/3) ... [2024-11-10 10:39:59,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7503a0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:59, skipping insertion in model container [2024-11-10 10:39:59,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:59" (3/3) ... [2024-11-10 10:39:59,716 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-10 10:39:59,727 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:39:59,727 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:39:59,727 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:39:59,757 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:39:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 64 flow [2024-11-10 10:39:59,810 INFO L124 PetriNetUnfolderBase]: 8/45 cut-off events. [2024-11-10 10:39:59,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:39:59,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 8/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 24. Up to 4 conditions per place. [2024-11-10 10:39:59,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 64 flow [2024-11-10 10:39:59,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 55 flow [2024-11-10 10:39:59,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:39:59,828 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;@7591d9fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:39:59,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:39:59,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:39:59,834 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-10 10:39:59,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:39:59,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:59,836 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:59,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:39:59,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1593328314, now seen corresponding path program 1 times [2024-11-10 10:39:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:59,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723989126] [2024-11-10 10:39:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723989126] [2024-11-10 10:40:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723989126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519382988] [2024-11-10 10:40:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:00,132 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:40:00,134 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:40:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 10:40:00,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:40:00,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:40:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519382988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:40:00,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:40:00,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-10 10:40:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25259093] [2024-11-10 10:40:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:40:00,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:40:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:40:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:40:00,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2024-11-10 10:40:00,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 55 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:00,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:00,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2024-11-10 10:40:00,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:00,434 INFO L124 PetriNetUnfolderBase]: 55/152 cut-off events. [2024-11-10 10:40:00,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:40:00,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 152 events. 55/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 494 event pairs, 15 based on Foata normal form. 19/171 useless extension candidates. Maximal degree in co-relation 226. Up to 99 conditions per place. [2024-11-10 10:40:00,437 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 18 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2024-11-10 10:40:00,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 108 flow [2024-11-10 10:40:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:40:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:40:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2024-11-10 10:40:00,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-11-10 10:40:00,447 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 55 flow. Second operand 5 states and 67 transitions. [2024-11-10 10:40:00,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 108 flow [2024-11-10 10:40:00,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:40:00,450 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 62 flow [2024-11-10 10:40:00,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2024-11-10 10:40:00,455 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2024-11-10 10:40:00,455 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 62 flow [2024-11-10 10:40:00,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:00,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:00,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:00,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:40:00,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-10 10:40:00,656 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:40:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1803570896, now seen corresponding path program 1 times [2024-11-10 10:40:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794477013] [2024-11-10 10:40:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,732 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:40:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794477013] [2024-11-10 10:40:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794477013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:40:00,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:40:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:40:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6939424] [2024-11-10 10:40:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:40:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:40:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:40:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:40:00,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2024-11-10 10:40:00,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:00,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:00,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2024-11-10 10:40:00,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:00,786 INFO L124 PetriNetUnfolderBase]: 53/134 cut-off events. [2024-11-10 10:40:00,786 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 10:40:00,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 134 events. 53/134 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 365 event pairs, 12 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 248. Up to 99 conditions per place. [2024-11-10 10:40:00,787 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 17 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2024-11-10 10:40:00,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 104 flow [2024-11-10 10:40:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:40:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:40:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2024-11-10 10:40:00,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-11-10 10:40:00,792 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 4 states and 49 transitions. [2024-11-10 10:40:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 104 flow [2024-11-10 10:40:00,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:40:00,793 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 60 flow [2024-11-10 10:40:00,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2024-11-10 10:40:00,794 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2024-11-10 10:40:00,794 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 60 flow [2024-11-10 10:40:00,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:00,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:00,794 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:00,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:40:00,794 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:40:00,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1253913832, now seen corresponding path program 1 times [2024-11-10 10:40:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070473293] [2024-11-10 10:40:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070473293] [2024-11-10 10:40:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070473293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:40:00,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:40:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:40:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241891749] [2024-11-10 10:40:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:40:00,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:40:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:40:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:40:00,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2024-11-10 10:40:00,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:00,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:00,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2024-11-10 10:40:00,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:01,053 INFO L124 PetriNetUnfolderBase]: 70/159 cut-off events. [2024-11-10 10:40:01,054 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 10:40:01,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 159 events. 70/159 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 453 event pairs, 28 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 304. Up to 67 conditions per place. [2024-11-10 10:40:01,055 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 25 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2024-11-10 10:40:01,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 163 flow [2024-11-10 10:40:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:40:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:40:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-11-10 10:40:01,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-11-10 10:40:01,058 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 60 flow. Second operand 6 states and 82 transitions. [2024-11-10 10:40:01,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 163 flow [2024-11-10 10:40:01,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 155 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:40:01,059 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 95 flow [2024-11-10 10:40:01,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2024-11-10 10:40:01,062 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2024-11-10 10:40:01,062 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 95 flow [2024-11-10 10:40:01,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:01,063 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:01,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:40:01,063 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:40:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash -313957707, now seen corresponding path program 1 times [2024-11-10 10:40:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033641079] [2024-11-10 10:40:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:01,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033641079] [2024-11-10 10:40:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033641079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:40:01,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:40:01,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:40:01,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781951657] [2024-11-10 10:40:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:40:01,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:40:01,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:40:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:40:01,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2024-11-10 10:40:01,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:01,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2024-11-10 10:40:01,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:01,245 INFO L124 PetriNetUnfolderBase]: 68/161 cut-off events. [2024-11-10 10:40:01,245 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2024-11-10 10:40:01,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 161 events. 68/161 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 512 event pairs, 38 based on Foata normal form. 4/156 useless extension candidates. Maximal degree in co-relation 390. Up to 101 conditions per place. [2024-11-10 10:40:01,247 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 17 selfloop transitions, 6 changer transitions 3/32 dead transitions. [2024-11-10 10:40:01,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 165 flow [2024-11-10 10:40:01,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:40:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:40:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-11-10 10:40:01,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-11-10 10:40:01,248 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 95 flow. Second operand 5 states and 64 transitions. [2024-11-10 10:40:01,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 165 flow [2024-11-10 10:40:01,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:40:01,250 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 119 flow [2024-11-10 10:40:01,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2024-11-10 10:40:01,251 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2024-11-10 10:40:01,251 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 119 flow [2024-11-10 10:40:01,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:01,251 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:01,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:40:01,251 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:40:01,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1899435253, now seen corresponding path program 1 times [2024-11-10 10:40:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401868308] [2024-11-10 10:40:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401868308] [2024-11-10 10:40:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401868308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646407537] [2024-11-10 10:40:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:01,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:40:01,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:40:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:01,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:40:01,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:01,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:40:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646407537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:40:01,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:40:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 10:40:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363055532] [2024-11-10 10:40:01,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:40:01,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:40:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:40:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:40:01,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2024-11-10 10:40:01,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 119 flow. Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 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,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:01,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2024-11-10 10:40:01,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:01,699 INFO L124 PetriNetUnfolderBase]: 84/209 cut-off events. [2024-11-10 10:40:01,699 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-11-10 10:40:01,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 209 events. 84/209 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 742 event pairs, 38 based on Foata normal form. 8/210 useless extension candidates. Maximal degree in co-relation 563. Up to 97 conditions per place. [2024-11-10 10:40:01,701 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 21 selfloop transitions, 7 changer transitions 5/39 dead transitions. [2024-11-10 10:40:01,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 223 flow [2024-11-10 10:40:01,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:40:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:40:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-11-10 10:40:01,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2024-11-10 10:40:01,703 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 119 flow. Second operand 6 states and 79 transitions. [2024-11-10 10:40:01,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 223 flow [2024-11-10 10:40:01,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 214 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-10 10:40:01,707 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 142 flow [2024-11-10 10:40:01,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2024-11-10 10:40:01,709 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2024-11-10 10:40:01,709 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 142 flow [2024-11-10 10:40:01,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 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,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:01,710 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:01,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:40:01,910 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:40:01,911 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:40:01,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 20994962, now seen corresponding path program 2 times [2024-11-10 10:40:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:01,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140356600] [2024-11-10 10:40:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:40:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:01,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:40:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140356600] [2024-11-10 10:40:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140356600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:40:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095480091] [2024-11-10 10:40:01,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:40:01,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:40:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:40:01,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:40:01,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:40:02,041 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:40:02,042 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:40:02,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:40:02,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:40:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:40:02,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:40:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095480091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:40:02,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:40:02,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-10 10:40:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785401957] [2024-11-10 10:40:02,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:40:02,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:40:02,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:40:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:40:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:40:02,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2024-11-10 10:40:02,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:02,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:40:02,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2024-11-10 10:40:02,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:40:02,253 INFO L124 PetriNetUnfolderBase]: 52/165 cut-off events. [2024-11-10 10:40:02,253 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2024-11-10 10:40:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 165 events. 52/165 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 586 event pairs, 14 based on Foata normal form. 8/173 useless extension candidates. Maximal degree in co-relation 455. Up to 62 conditions per place. [2024-11-10 10:40:02,255 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 19 selfloop transitions, 2 changer transitions 13/40 dead transitions. [2024-11-10 10:40:02,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 243 flow [2024-11-10 10:40:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:40:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:40:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-11-10 10:40:02,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-11-10 10:40:02,261 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 142 flow. Second operand 8 states and 106 transitions. [2024-11-10 10:40:02,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 243 flow [2024-11-10 10:40:02,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 229 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 10:40:02,264 INFO L231 Difference]: Finished difference. Result has 45 places, 23 transitions, 104 flow [2024-11-10 10:40:02,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=104, PETRI_PLACES=45, PETRI_TRANSITIONS=23} [2024-11-10 10:40:02,265 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2024-11-10 10:40:02,265 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 23 transitions, 104 flow [2024-11-10 10:40:02,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:40:02,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:40:02,266 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:40:02,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:40:02,470 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:40:02,471 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:40:02,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:40:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 516414639, now seen corresponding path program 1 times [2024-11-10 10:40:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:40:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504674754] [2024-11-10 10:40:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:40:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:40:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:40:02,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:40:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:40:02,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:40:02,509 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:40:02,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-10 10:40:02,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-10 10:40:02,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-10 10:40:02,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:40:02,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:40:02,512 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-10 10:40:02,545 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:40:02,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:40:02,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:40:02 BasicIcfg [2024-11-10 10:40:02,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:40:02,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:40:02,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:40:02,553 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:40:02,554 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:59" (3/4) ... [2024-11-10 10:40:02,554 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:40:02,600 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:40:02,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:40:02,600 INFO L158 Benchmark]: Toolchain (without parser) took 3687.12ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 142.0MB in the beginning and 87.0MB in the end (delta: 55.1MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,601 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:40:02,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.47ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 117.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,601 INFO L158 Benchmark]: Boogie Preprocessor took 23.89ms. Allocated memory is still 176.2MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,604 INFO L158 Benchmark]: IcfgBuilder took 334.97ms. Allocated memory is still 176.2MB. Free memory was 113.7MB in the beginning and 93.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,604 INFO L158 Benchmark]: TraceAbstraction took 2841.77ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 92.8MB in the beginning and 91.1MB in the end (delta: 1.6MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,604 INFO L158 Benchmark]: Witness Printer took 46.96ms. Allocated memory is still 226.5MB. Free memory was 91.1MB in the beginning and 87.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:40:02,605 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.16ms. Allocated memory is still 125.8MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.47ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 117.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.89ms. Allocated memory is still 176.2MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 334.97ms. Allocated memory is still 176.2MB. Free memory was 113.7MB in the beginning and 93.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2841.77ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 92.8MB in the beginning and 91.1MB in the end (delta: 1.6MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * Witness Printer took 46.96ms. Allocated memory is still 226.5MB. Free memory was 91.1MB in the beginning and 87.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-2] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=-1] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, l=1, limit=2] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, l=1, limit=2] - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 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, 39 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: 2.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 584 SizeOfPredicates, 7 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 28/38 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:02,632 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