/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:10:55,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:10:55,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 12:10:55,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:10:55,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:10:55,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:10:55,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:10:55,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:10:55,210 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:10:55,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:10:55,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:10:55,211 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:10:55,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:10:55,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:10:55,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:10:55,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:10:55,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:10:55,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:10:55,213 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:10:55,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:10:55,213 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:10:55,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:10:55,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:10:55,214 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:10:55,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:10:55,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:10:55,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:10:55,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:10:55,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:10:55,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:10:55,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:10:55,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:10:55,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:10:55,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:10:55,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:10:55,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:10:55,384 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:10:55,384 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:10:55,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-11-17 12:10:56,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:10:56,588 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:10:56,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-11-17 12:10:56,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d12bc64/6478be0d8d3e44f580e00415bedddc54/FLAG9019f3f1a [2023-11-17 12:10:56,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d12bc64/6478be0d8d3e44f580e00415bedddc54 [2023-11-17 12:10:56,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:10:56,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:10:56,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:10:56,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:10:56,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:10:56,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658b7c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56, skipping insertion in model container [2023-11-17 12:10:56,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,626 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:10:56,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2023-11-17 12:10:56,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:10:56,792 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:10:56,818 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2023-11-17 12:10:56,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:10:56,833 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:10:56,833 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:10:56,838 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:10:56,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56 WrapperNode [2023-11-17 12:10:56,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:10:56,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:10:56,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:10:56,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:10:56,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,881 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2023-11-17 12:10:56,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:10:56,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:10:56,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:10:56,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:10:56,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:10:56,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:10:56,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:10:56,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:10:56,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2023-11-17 12:10:56,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:10:56,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:10:56,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 12:10:56,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 12:10:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:10:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:10:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:10:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:10:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:10:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:10:56,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:10:56,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:10:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:10:56,976 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 12:10:57,051 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:10:57,053 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:10:57,278 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:10:57,460 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:10:57,460 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 12:10:57,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:10:57 BoogieIcfgContainer [2023-11-17 12:10:57,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:10:57,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:10:57,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:10:57,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:10:57,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:10:56" (1/3) ... [2023-11-17 12:10:57,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40260a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:10:57, skipping insertion in model container [2023-11-17 12:10:57,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (2/3) ... [2023-11-17 12:10:57,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40260a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:10:57, skipping insertion in model container [2023-11-17 12:10:57,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:10:57" (3/3) ... [2023-11-17 12:10:57,469 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-11-17 12:10:57,480 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:10:57,480 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:10:57,480 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:10:57,517 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 12:10:57,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 68 flow [2023-11-17 12:10:57,569 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2023-11-17 12:10:57,569 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:10:57,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 3/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/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-11-17 12:10:57,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 27 transitions, 68 flow [2023-11-17 12:10:57,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 24 transitions, 60 flow [2023-11-17 12:10:57,578 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:10:57,586 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 60 flow [2023-11-17 12:10:57,589 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 60 flow [2023-11-17 12:10:57,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 60 flow [2023-11-17 12:10:57,599 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2023-11-17 12:10:57,599 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:10:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-11-17 12:10:57,600 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-11-17 12:10:57,831 INFO L134 LiptonReduction]: Checked pairs total: 164 [2023-11-17 12:10:57,833 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-11-17 12:10:57,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:10:57,856 INFO L357 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, mHoare=false, 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;@570b43dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:10:57,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 12:10:57,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:10:57,867 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2023-11-17 12:10:57,867 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:10:57,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:57,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:57,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:57,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1915610730, now seen corresponding path program 1 times [2023-11-17 12:10:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752767099] [2023-11-17 12:10:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752767099] [2023-11-17 12:10:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752767099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:10:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:10:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 12:10:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274090047] [2023-11-17 12:10:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:10:58,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:10:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:10:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:10:58,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2023-11-17 12:10:58,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2023-11-17 12:10:58,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:58,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2023-11-17 12:10:58,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:58,347 INFO L124 PetriNetUnfolderBase]: 125/222 cut-off events. [2023-11-17 12:10:58,347 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-17 12:10:58,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 222 events. 125/222 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 678 event pairs, 45 based on Foata normal form. 1/182 useless extension candidates. Maximal degree in co-relation 380. Up to 126 conditions per place. [2023-11-17 12:10:58,351 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 29 selfloop transitions, 3 changer transitions 1/33 dead transitions. [2023-11-17 12:10:58,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 153 flow [2023-11-17 12:10:58,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:10:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:10:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2023-11-17 12:10:58,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2023-11-17 12:10:58,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 49 transitions. [2023-11-17 12:10:58,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 49 transitions. [2023-11-17 12:10:58,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:58,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 49 transitions. [2023-11-17 12:10:58,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2023-11-17 12:10:58,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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) [2023-11-17 12:10:58,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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) [2023-11-17 12:10:58,371 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 49 transitions. [2023-11-17 12:10:58,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 153 flow [2023-11-17 12:10:58,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 33 transitions, 139 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 12:10:58,375 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2023-11-17 12:10:58,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2023-11-17 12:10:58,380 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-11-17 12:10:58,380 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2023-11-17 12:10:58,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2023-11-17 12:10:58,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:58,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:58,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:10:58,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:58,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 883565230, now seen corresponding path program 1 times [2023-11-17 12:10:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230518579] [2023-11-17 12:10:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230518579] [2023-11-17 12:10:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230518579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:10:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:10:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:10:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877631447] [2023-11-17 12:10:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:10:58,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:10:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:10:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 12:10:58,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2023-11-17 12:10:58,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2023-11-17 12:10:58,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:58,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2023-11-17 12:10:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:58,850 INFO L124 PetriNetUnfolderBase]: 193/357 cut-off events. [2023-11-17 12:10:58,850 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-17 12:10:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 357 events. 193/357 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1364 event pairs, 129 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 349. Up to 223 conditions per place. [2023-11-17 12:10:58,857 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 41 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2023-11-17 12:10:58,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 46 transitions, 220 flow [2023-11-17 12:10:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:10:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:10:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2023-11-17 12:10:58,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2023-11-17 12:10:58,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 68 transitions. [2023-11-17 12:10:58,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 68 transitions. [2023-11-17 12:10:58,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:58,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 68 transitions. [2023-11-17 12:10:58,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2023-11-17 12:10:58,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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) [2023-11-17 12:10:58,866 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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) [2023-11-17 12:10:58,866 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 68 transitions. [2023-11-17 12:10:58,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 46 transitions, 220 flow [2023-11-17 12:10:58,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 46 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:10:58,869 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 94 flow [2023-11-17 12:10:58,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2023-11-17 12:10:58,870 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-11-17 12:10:58,871 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 25 transitions, 94 flow [2023-11-17 12:10:58,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2023-11-17 12:10:58,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:58,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:58,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:10:58,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:58,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash -762395524, now seen corresponding path program 1 times [2023-11-17 12:10:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857923402] [2023-11-17 12:10:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857923402] [2023-11-17 12:10:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857923402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:10:59,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:10:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:10:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631891937] [2023-11-17 12:10:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:10:59,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:10:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:59,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:10:59,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 12:10:59,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2023-11-17 12:10:59,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2023-11-17 12:10:59,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:59,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2023-11-17 12:10:59,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:59,147 INFO L124 PetriNetUnfolderBase]: 149/279 cut-off events. [2023-11-17 12:10:59,147 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-17 12:10:59,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 279 events. 149/279 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 961 event pairs, 105 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 549. Up to 223 conditions per place. [2023-11-17 12:10:59,150 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 20 selfloop transitions, 2 changer transitions 17/39 dead transitions. [2023-11-17 12:10:59,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 213 flow [2023-11-17 12:10:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:10:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:10:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2023-11-17 12:10:59,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2023-11-17 12:10:59,153 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 63 transitions. [2023-11-17 12:10:59,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 63 transitions. [2023-11-17 12:10:59,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:59,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 63 transitions. [2023-11-17 12:10:59,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2023-11-17 12:10:59,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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) [2023-11-17 12:10:59,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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) [2023-11-17 12:10:59,156 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 94 flow. Second operand 5 states and 63 transitions. [2023-11-17 12:10:59,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 213 flow [2023-11-17 12:10:59,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 209 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 12:10:59,159 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 82 flow [2023-11-17 12:10:59,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-17 12:10:59,160 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-11-17 12:10:59,161 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 82 flow [2023-11-17 12:10:59,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2023-11-17 12:10:59,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:59,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:59,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:10:59,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:59,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1541216642, now seen corresponding path program 1 times [2023-11-17 12:10:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075005083] [2023-11-17 12:10:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075005083] [2023-11-17 12:10:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075005083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:10:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393303582] [2023-11-17 12:10:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:10:59,303 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) [2023-11-17 12:10:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 12:10:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:59,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:10:59,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:10:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:59,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:10:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393303582] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:10:59,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:10:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-17 12:10:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028473184] [2023-11-17 12:10:59,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:10:59,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 12:10:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 12:10:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 12:10:59,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2023-11-17 12:10:59,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 82 flow. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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) [2023-11-17 12:10:59,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:59,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2023-11-17 12:10:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:59,683 INFO L124 PetriNetUnfolderBase]: 133/236 cut-off events. [2023-11-17 12:10:59,683 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-11-17 12:10:59,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 236 events. 133/236 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 769 event pairs, 42 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 643. Up to 123 conditions per place. [2023-11-17 12:10:59,687 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2023-11-17 12:10:59,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 218 flow [2023-11-17 12:10:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 12:10:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 12:10:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2023-11-17 12:10:59,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2023-11-17 12:10:59,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 72 transitions. [2023-11-17 12:10:59,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 72 transitions. [2023-11-17 12:10:59,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:59,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 72 transitions. [2023-11-17 12:10:59,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2023-11-17 12:10:59,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 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) [2023-11-17 12:10:59,692 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 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) [2023-11-17 12:10:59,692 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 82 flow. Second operand 7 states and 72 transitions. [2023-11-17 12:10:59,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 218 flow [2023-11-17 12:10:59,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 186 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-17 12:10:59,694 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 99 flow [2023-11-17 12:10:59,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-11-17 12:10:59,694 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2023-11-17 12:10:59,694 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 99 flow [2023-11-17 12:10:59,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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) [2023-11-17 12:10:59,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:59,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:59,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 12:10:59,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:59,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:59,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:59,896 INFO L85 PathProgramCache]: Analyzing trace with hash -852786294, now seen corresponding path program 1 times [2023-11-17 12:10:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037834096] [2023-11-17 12:10:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037834096] [2023-11-17 12:11:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037834096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325900867] [2023-11-17 12:11:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:00,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:00,037 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) [2023-11-17 12:11:00,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 12:11:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:00,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:11:00,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:11:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:00,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:11:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325900867] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:00,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:11:00,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 12:11:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013654440] [2023-11-17 12:11:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:11:00,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:11:00,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:00,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:11:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 12:11:00,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2023-11-17 12:11:00,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2023-11-17 12:11:00,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:00,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2023-11-17 12:11:00,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:00,403 INFO L124 PetriNetUnfolderBase]: 125/220 cut-off events. [2023-11-17 12:11:00,403 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-17 12:11:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 220 events. 125/220 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 672 event pairs, 45 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 605. Up to 126 conditions per place. [2023-11-17 12:11:00,404 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-11-17 12:11:00,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 220 flow [2023-11-17 12:11:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:11:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:11:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2023-11-17 12:11:00,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2023-11-17 12:11:00,417 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 54 transitions. [2023-11-17 12:11:00,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 54 transitions. [2023-11-17 12:11:00,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:00,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 54 transitions. [2023-11-17 12:11:00,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-11-17 12:11:00,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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) [2023-11-17 12:11:00,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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) [2023-11-17 12:11:00,419 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 99 flow. Second operand 5 states and 54 transitions. [2023-11-17 12:11:00,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 220 flow [2023-11-17 12:11:00,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 12:11:00,420 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 123 flow [2023-11-17 12:11:00,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-17 12:11:00,421 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2023-11-17 12:11:00,421 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 123 flow [2023-11-17 12:11:00,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2023-11-17 12:11:00,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:00,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:00,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 12:11:00,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:00,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:11:00,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash -13603024, now seen corresponding path program 1 times [2023-11-17 12:11:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087068034] [2023-11-17 12:11:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:00,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087068034] [2023-11-17 12:11:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087068034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126267583] [2023-11-17 12:11:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:01,045 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) [2023-11-17 12:11:01,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 12:11:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:01,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 12:11:01,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:11:01,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:11:01,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:01,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:01,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:11:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126267583] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:11:01,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:11:01,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 17 [2023-11-17 12:11:01,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953276378] [2023-11-17 12:11:01,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:11:01,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:11:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:01,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:11:01,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-17 12:11:01,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2023-11-17 12:11:01,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 123 flow. Second operand has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 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) [2023-11-17 12:11:01,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:01,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2023-11-17 12:11:01,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:01,929 INFO L124 PetriNetUnfolderBase]: 339/584 cut-off events. [2023-11-17 12:11:01,929 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2023-11-17 12:11:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 584 events. 339/584 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2309 event pairs, 32 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 1972. Up to 244 conditions per place. [2023-11-17 12:11:01,933 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 95 selfloop transitions, 53 changer transitions 2/150 dead transitions. [2023-11-17 12:11:01,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 150 transitions, 967 flow [2023-11-17 12:11:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 12:11:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 12:11:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 214 transitions. [2023-11-17 12:11:01,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2907608695652174 [2023-11-17 12:11:01,936 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 214 transitions. [2023-11-17 12:11:01,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 214 transitions. [2023-11-17 12:11:01,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:01,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 214 transitions. [2023-11-17 12:11:01,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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) [2023-11-17 12:11:01,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 32.0) internal successors, (768), 24 states have internal predecessors, (768), 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) [2023-11-17 12:11:01,938 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 32.0) internal successors, (768), 24 states have internal predecessors, (768), 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) [2023-11-17 12:11:01,938 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 123 flow. Second operand 23 states and 214 transitions. [2023-11-17 12:11:01,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 150 transitions, 967 flow [2023-11-17 12:11:01,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 150 transitions, 939 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 12:11:01,942 INFO L231 Difference]: Finished difference. Result has 66 places, 85 transitions, 685 flow [2023-11-17 12:11:01,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=685, PETRI_PLACES=66, PETRI_TRANSITIONS=85} [2023-11-17 12:11:01,943 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 43 predicate places. [2023-11-17 12:11:01,943 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 85 transitions, 685 flow [2023-11-17 12:11:01,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 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) [2023-11-17 12:11:01,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:01,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:01,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 12:11:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:02,150 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:11:02,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash 808891566, now seen corresponding path program 2 times [2023-11-17 12:11:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:02,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134734067] [2023-11-17 12:11:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 12:11:02,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 12:11:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 12:11:02,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 12:11:02,220 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 12:11:02,221 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 12:11:02,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 12:11:02,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 12:11:02,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 12:11:02,223 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-17 12:11:02,226 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 12:11:02,226 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 12:11:02,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 12:11:02,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 12:11:02,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 12:11:02,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-17 12:11:02,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 12:11:02,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-17 12:11:02,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-17 12:11:02,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 12:11:02,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-17 12:11:02,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:11:02 BasicIcfg [2023-11-17 12:11:02,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 12:11:02,284 INFO L158 Benchmark]: Toolchain (without parser) took 5678.44ms. Allocated memory was 294.6MB in the beginning and 383.8MB in the end (delta: 89.1MB). Free memory was 242.0MB in the beginning and 262.0MB in the end (delta: -20.1MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2023-11-17 12:11:02,284 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 239.1MB. Free memory was 190.5MB in the beginning and 190.4MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:11:02,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.35ms. Allocated memory is still 294.6MB. Free memory was 241.7MB in the beginning and 229.8MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 12:11:02,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.56ms. Allocated memory is still 294.6MB. Free memory was 229.8MB in the beginning and 227.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:11:02,285 INFO L158 Benchmark]: Boogie Preprocessor took 31.92ms. Allocated memory is still 294.6MB. Free memory was 227.8MB in the beginning and 226.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:11:02,285 INFO L158 Benchmark]: RCFGBuilder took 547.07ms. Allocated memory is still 294.6MB. Free memory was 226.2MB in the beginning and 237.1MB in the end (delta: -10.9MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. [2023-11-17 12:11:02,285 INFO L158 Benchmark]: TraceAbstraction took 4819.60ms. Allocated memory was 294.6MB in the beginning and 383.8MB in the end (delta: 89.1MB). Free memory was 236.6MB in the beginning and 262.0MB in the end (delta: -25.4MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. [2023-11-17 12:11:02,286 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 239.1MB. Free memory was 190.5MB in the beginning and 190.4MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.35ms. Allocated memory is still 294.6MB. Free memory was 241.7MB in the beginning and 229.8MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.56ms. Allocated memory is still 294.6MB. Free memory was 229.8MB in the beginning and 227.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.92ms. Allocated memory is still 294.6MB. Free memory was 227.8MB in the beginning and 226.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 547.07ms. Allocated memory is still 294.6MB. Free memory was 226.2MB in the beginning and 237.1MB in the end (delta: -10.9MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4819.60ms. Allocated memory was 294.6MB in the beginning and 383.8MB in the end (delta: 89.1MB). Free memory was 236.6MB in the beginning and 262.0MB in the end (delta: -25.4MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 23 PlacesAfterwards, 24 TransitionsBefore, 19 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 164 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 97, unknown conditional: 0, unknown unconditional: 97] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1={5:0}, t2={3:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1={5:0}, t2={3:0}] [L83] 0 \read(t1) VAL [A={-2:0}, N=1, counter=0, t1={5:0}, t2={3:0}] [L62] 2 int i=0; VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=0, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L49] 1 int i=0; VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=-6, i=1, tmp=-6] [L49] COND FALSE 1 !(i