/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 -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 16:08:16,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:08:17,044 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 16:08:17,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:08:17,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:08:17,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:08:17,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:08:17,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:08:17,073 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:08:17,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:08:17,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:08:17,077 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:08:17,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:08:17,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:08:17,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:08:17,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:08:17,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:08:17,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:08:17,079 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:08:17,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:08:17,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:08:17,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:08:17,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:08:17,080 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:08:17,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:08:17,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:08:17,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:08:17,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:08:17,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:08:17,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:08:17,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:08:17,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:08:17,082 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 [2023-11-17 16:08:17,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:08:17,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:08:17,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:08:17,275 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:08:17,275 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:08:17,276 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 16:08:18,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:08:18,439 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:08:18,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-11-17 16:08:18,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d30a6b1/afa85320a298478c95268292b2f33208/FLAG4d91728b6 [2023-11-17 16:08:18,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d30a6b1/afa85320a298478c95268292b2f33208 [2023-11-17 16:08:18,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:08:18,457 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:08:18,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:08:18,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:08:18,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:08:18,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c11eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18, skipping insertion in model container [2023-11-17 16:08:18,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,480 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:08:18,586 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 16:08:18,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:08:18,604 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:08:18,619 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 16:08:18,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:08:18,629 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:08:18,629 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:08:18,634 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:08:18,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18 WrapperNode [2023-11-17 16:08:18,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:08:18,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:08:18,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:08:18,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:08:18,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,692 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2023-11-17 16:08:18,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:08:18,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:08:18,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:08:18,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:08:18,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:08:18,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:08:18,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:08:18,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:08:18,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (1/1) ... [2023-11-17 16:08:18,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:08:18,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:08:18,766 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 16:08:18,797 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 16:08:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:08:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:08:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:08:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:08:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:08:18,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:08:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:08:18,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:08:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:08:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:08:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:08:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:08:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:08:18,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:08:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:08:18,807 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 16:08:18,903 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:08:18,905 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:08:19,149 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:08:19,251 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:08:19,251 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 16:08:19,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:08:19 BoogieIcfgContainer [2023-11-17 16:08:19,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:08:19,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:08:19,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:08:19,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:08:19,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:08:18" (1/3) ... [2023-11-17 16:08:19,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e5fd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:08:19, skipping insertion in model container [2023-11-17 16:08:19,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:08:18" (2/3) ... [2023-11-17 16:08:19,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e5fd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:08:19, skipping insertion in model container [2023-11-17 16:08:19,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:08:19" (3/3) ... [2023-11-17 16:08:19,258 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-11-17 16:08:19,270 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:08:19,270 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:08:19,270 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:08:19,316 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 16:08:19,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 122 transitions, 258 flow [2023-11-17 16:08:19,372 INFO L124 PetriNetUnfolderBase]: 9/120 cut-off events. [2023-11-17 16:08:19,373 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:08:19,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-11-17 16:08:19,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 122 transitions, 258 flow [2023-11-17 16:08:19,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 111 transitions, 234 flow [2023-11-17 16:08:19,386 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:08:19,401 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 111 transitions, 234 flow [2023-11-17 16:08:19,407 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 111 transitions, 234 flow [2023-11-17 16:08:19,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 234 flow [2023-11-17 16:08:19,449 INFO L124 PetriNetUnfolderBase]: 9/111 cut-off events. [2023-11-17 16:08:19,449 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:08:19,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 9/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-11-17 16:08:19,451 INFO L119 LiptonReduction]: Number of co-enabled transitions 728 [2023-11-17 16:08:22,127 INFO L134 LiptonReduction]: Checked pairs total: 953 [2023-11-17 16:08:22,127 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-11-17 16:08:22,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:08:22,158 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;@1c922c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:08:22,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 16:08:22,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:08:22,162 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2023-11-17 16:08:22,162 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:08:22,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:22,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:08:22,163 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 16:08:22,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 575061126, now seen corresponding path program 1 times [2023-11-17 16:08:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534890368] [2023-11-17 16:08:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:22,356 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 16:08:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:08:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534890368] [2023-11-17 16:08:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534890368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:08:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:08:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:08:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446008890] [2023-11-17 16:08:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:08:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:08:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:08:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:08:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:08:22,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-11-17 16:08:22,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 16:08:22,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:08:22,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-11-17 16:08:22,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:08:22,445 INFO L124 PetriNetUnfolderBase]: 125/222 cut-off events. [2023-11-17 16:08:22,445 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-17 16:08:22,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 222 events. 125/222 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 682 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 16:08:22,448 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 29 selfloop transitions, 3 changer transitions 1/33 dead transitions. [2023-11-17 16:08:22,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 153 flow [2023-11-17 16:08:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:08:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:08:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-11-17 16:08:22,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49928469241773965 [2023-11-17 16:08:22,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-11-17 16:08:22,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-11-17 16:08:22,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:08:22,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-11-17 16:08:22,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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 16:08:22,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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 16:08:22,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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 16:08:22,467 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 349 transitions. [2023-11-17 16:08:22,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 153 flow [2023-11-17 16:08:22,469 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 16:08:22,470 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2023-11-17 16:08:22,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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 16:08:22,474 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-11-17 16:08:22,474 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2023-11-17 16:08:22,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 16:08:22,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:22,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:08:22,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:08:22,475 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 16:08:22,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -584020264, now seen corresponding path program 1 times [2023-11-17 16:08:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:22,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316375066] [2023-11-17 16:08:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:22,575 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 16:08:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:08:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316375066] [2023-11-17 16:08:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316375066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:08:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:08:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:08:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926439834] [2023-11-17 16:08:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:08:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:08:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:08:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:08:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 16:08:22,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 233 [2023-11-17 16:08:22,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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 16:08:22,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:08:22,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 233 [2023-11-17 16:08:22,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:08:22,661 INFO L124 PetriNetUnfolderBase]: 193/357 cut-off events. [2023-11-17 16:08:22,661 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-17 16:08:22,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 357 events. 193/357 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1351 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 16:08:22,663 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 41 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2023-11-17 16:08:22,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 46 transitions, 220 flow [2023-11-17 16:08:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:08:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:08:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-11-17 16:08:22,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40171673819742487 [2023-11-17 16:08:22,666 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-11-17 16:08:22,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-11-17 16:08:22,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:08:22,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-11-17 16:08:22,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 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 16:08:22,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:22,670 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:22,670 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 468 transitions. [2023-11-17 16:08:22,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 46 transitions, 220 flow [2023-11-17 16:08:22,670 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 16:08:22,671 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 94 flow [2023-11-17 16:08:22,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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 16:08:22,672 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-11-17 16:08:22,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 25 transitions, 94 flow [2023-11-17 16:08:22,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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 16:08:22,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:22,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:08:22,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:08:22,672 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 16:08:22,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1955674032, now seen corresponding path program 1 times [2023-11-17 16:08:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321099487] [2023-11-17 16:08:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:22,775 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 16:08:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:08:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321099487] [2023-11-17 16:08:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321099487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:08:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:08:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:08:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344447718] [2023-11-17 16:08:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:08:22,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:08:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:08:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:08:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 16:08:22,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 233 [2023-11-17 16:08:22,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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 16:08:22,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:08:22,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 233 [2023-11-17 16:08:22,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:08:22,846 INFO L124 PetriNetUnfolderBase]: 149/279 cut-off events. [2023-11-17 16:08:22,846 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-17 16:08:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 279 events. 149/279 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 973 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 16:08:22,847 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 20 selfloop transitions, 2 changer transitions 17/39 dead transitions. [2023-11-17 16:08:22,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 213 flow [2023-11-17 16:08:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:08:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:08:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-11-17 16:08:22,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39742489270386266 [2023-11-17 16:08:22,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-11-17 16:08:22,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-11-17 16:08:22,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:08:22,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-11-17 16:08:22,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:08:22,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:22,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:22,853 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 94 flow. Second operand 5 states and 463 transitions. [2023-11-17 16:08:22,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 213 flow [2023-11-17 16:08:22,853 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 16:08:22,854 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 82 flow [2023-11-17 16:08:22,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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 16:08:22,855 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-11-17 16:08:22,855 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 82 flow [2023-11-17 16:08:22,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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 16:08:22,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:22,855 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 16:08:22,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:08:22,856 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 16:08:22,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2032095784, now seen corresponding path program 1 times [2023-11-17 16:08:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:22,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477873217] [2023-11-17 16:08:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:22,997 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 16:08:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:08:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477873217] [2023-11-17 16:08:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477873217] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:08:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412878507] [2023-11-17 16:08:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:22,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:08:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:08:23,001 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 16:08:23,015 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 16:08:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:23,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:08:23,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:08:23,150 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 16:08:23,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:08:23,178 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 16:08:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412878507] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:08:23,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:08:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 16:08:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933416846] [2023-11-17 16:08:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:08:23,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:08:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:08:23,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:08:23,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 16:08:23,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 233 [2023-11-17 16:08:23,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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 16:08:23,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:08:23,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 233 [2023-11-17 16:08:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:08:23,234 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2023-11-17 16:08:23,234 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-17 16:08:23,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 217 events. 122/217 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 681 event pairs, 42 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 591. Up to 117 conditions per place. [2023-11-17 16:08:23,236 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2023-11-17 16:08:23,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 175 flow [2023-11-17 16:08:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:08:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:08:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2023-11-17 16:08:23,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38969957081545065 [2023-11-17 16:08:23,237 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 454 transitions. [2023-11-17 16:08:23,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 454 transitions. [2023-11-17 16:08:23,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:08:23,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 454 transitions. [2023-11-17 16:08:23,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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 16:08:23,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:23,241 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:23,241 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 82 flow. Second operand 5 states and 454 transitions. [2023-11-17 16:08:23,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 175 flow [2023-11-17 16:08:23,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 149 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-17 16:08:23,242 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 91 flow [2023-11-17 16:08:23,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-11-17 16:08:23,243 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-11-17 16:08:23,243 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 91 flow [2023-11-17 16:08:23,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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 16:08:23,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:23,243 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 16:08:23,263 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 16:08:23,449 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 16:08:23,449 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 16:08:23,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -656641580, now seen corresponding path program 1 times [2023-11-17 16:08:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402820916] [2023-11-17 16:08:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:23,502 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 16:08:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:08:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402820916] [2023-11-17 16:08:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402820916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:08:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553309672] [2023-11-17 16:08:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:23,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:08:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:08:23,504 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 16:08:23,521 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 16:08:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:23,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:08:23,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:08:23,614 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 16:08:23,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:08:23,636 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 16:08:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553309672] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:08:23,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:08:23,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 16:08:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712938954] [2023-11-17 16:08:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:08:23,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:08:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:08:23,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:08:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 16:08:23,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 233 [2023-11-17 16:08:23,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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 16:08:23,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:08:23,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 233 [2023-11-17 16:08:23,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:08:23,688 INFO L124 PetriNetUnfolderBase]: 114/201 cut-off events. [2023-11-17 16:08:23,688 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-17 16:08:23,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 201 events. 114/201 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 594 event pairs, 39 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 553. Up to 112 conditions per place. [2023-11-17 16:08:23,689 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2023-11-17 16:08:23,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 202 flow [2023-11-17 16:08:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:08:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:08:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2023-11-17 16:08:23,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38969957081545065 [2023-11-17 16:08:23,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 454 transitions. [2023-11-17 16:08:23,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 454 transitions. [2023-11-17 16:08:23,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:08:23,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 454 transitions. [2023-11-17 16:08:23,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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 16:08:23,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:23,693 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 16:08:23,693 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 91 flow. Second operand 5 states and 454 transitions. [2023-11-17 16:08:23,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 202 flow [2023-11-17 16:08:23,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 191 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 16:08:23,694 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 111 flow [2023-11-17 16:08:23,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-17 16:08:23,695 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-11-17 16:08:23,695 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 111 flow [2023-11-17 16:08:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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 16:08:23,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:23,695 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 16:08:23,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 16:08:23,900 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 16:08:23,901 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 16:08:23,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1792021106, now seen corresponding path program 1 times [2023-11-17 16:08:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500550758] [2023-11-17 16:08:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:23,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:24,193 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 16:08:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:08:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500550758] [2023-11-17 16:08:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500550758] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:08:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298812421] [2023-11-17 16:08:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:08:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:08:24,210 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 16:08:24,237 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 16:08:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:08:24,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:08:24,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:08:24,322 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 16:08:24,350 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 16:08:24,370 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 16:08:24,416 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 16:08:24,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:08:24,473 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 16:08:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298812421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:08:24,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:08:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 17 [2023-11-17 16:08:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467926419] [2023-11-17 16:08:24,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:08:24,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:08:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:08:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:08:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:08:24,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 233 [2023-11-17 16:08:24,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 111 flow. Second operand has 19 states, 19 states have (on average 68.15789473684211) internal successors, (1295), 19 states have internal predecessors, (1295), 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 16:08:24,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:08:24,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 233 [2023-11-17 16:08:24,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:08:25,003 INFO L124 PetriNetUnfolderBase]: 317/546 cut-off events. [2023-11-17 16:08:25,004 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-11-17 16:08:25,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 546 events. 317/546 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2113 event pairs, 27 based on Foata normal form. 2/547 useless extension candidates. Maximal degree in co-relation 1794. Up to 217 conditions per place. [2023-11-17 16:08:25,007 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 94 selfloop transitions, 51 changer transitions 2/147 dead transitions. [2023-11-17 16:08:25,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 147 transitions, 923 flow [2023-11-17 16:08:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 16:08:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 16:08:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1663 transitions. [2023-11-17 16:08:25,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3103190893823475 [2023-11-17 16:08:25,011 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1663 transitions. [2023-11-17 16:08:25,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1663 transitions. [2023-11-17 16:08:25,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:08:25,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1663 transitions. [2023-11-17 16:08:25,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 72.30434782608695) internal successors, (1663), 23 states have internal predecessors, (1663), 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 16:08:25,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 233.0) internal successors, (5592), 24 states have internal predecessors, (5592), 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 16:08:25,019 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 233.0) internal successors, (5592), 24 states have internal predecessors, (5592), 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 16:08:25,019 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 111 flow. Second operand 23 states and 1663 transitions. [2023-11-17 16:08:25,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 147 transitions, 923 flow [2023-11-17 16:08:25,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 147 transitions, 895 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 16:08:25,022 INFO L231 Difference]: Finished difference. Result has 63 places, 82 transitions, 642 flow [2023-11-17 16:08:25,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=642, PETRI_PLACES=63, PETRI_TRANSITIONS=82} [2023-11-17 16:08:25,022 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 40 predicate places. [2023-11-17 16:08:25,022 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 82 transitions, 642 flow [2023-11-17 16:08:25,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 68.15789473684211) internal successors, (1295), 19 states have internal predecessors, (1295), 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 16:08:25,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:08:25,023 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 16:08:25,039 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 16:08:25,228 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 16:08:25,228 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 16:08:25,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:08:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 788058210, now seen corresponding path program 2 times [2023-11-17 16:08:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:08:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559547972] [2023-11-17 16:08:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:08:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:08:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 16:08:25,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 16:08:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 16:08:25,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 16:08:25,267 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 16:08:25,268 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 16:08:25,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 16:08:25,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 16:08:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 16:08:25,269 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-17 16:08:25,272 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:08:25,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:08:25,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 16:08:25,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 16:08:25,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 16:08:25,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-17 16:08:25,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 16:08:25,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-17 16:08:25,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-17 16:08:25,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 16:08:25,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-17 16:08:25,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:08:25 BasicIcfg [2023-11-17 16:08:25,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:08:25,305 INFO L158 Benchmark]: Toolchain (without parser) took 6848.29ms. Allocated memory was 210.8MB in the beginning and 311.4MB in the end (delta: 100.7MB). Free memory was 145.2MB in the beginning and 105.2MB in the end (delta: 40.1MB). Peak memory consumption was 141.0MB. Max. memory is 8.0GB. [2023-11-17 16:08:25,305 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 162.1MB in the beginning and 161.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:08:25,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.97ms. Allocated memory is still 210.8MB. Free memory was 145.0MB in the beginning and 133.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:08:25,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.67ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 133.1MB in the beginning and 219.2MB in the end (delta: -86.1MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2023-11-17 16:08:25,306 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 253.8MB. Free memory was 219.2MB in the beginning and 217.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 16:08:25,306 INFO L158 Benchmark]: RCFGBuilder took 527.30ms. Allocated memory is still 253.8MB. Free memory was 217.6MB in the beginning and 187.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 16:08:25,306 INFO L158 Benchmark]: TraceAbstraction took 6050.86ms. Allocated memory was 253.8MB in the beginning and 311.4MB in the end (delta: 57.7MB). Free memory was 187.2MB in the beginning and 105.2MB in the end (delta: 82.0MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. [2023-11-17 16:08:25,307 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.13ms. Allocated memory is still 210.8MB. Free memory was 162.1MB in the beginning and 161.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.97ms. Allocated memory is still 210.8MB. Free memory was 145.0MB in the beginning and 133.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.67ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 133.1MB in the beginning and 219.2MB in the end (delta: -86.1MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 253.8MB. Free memory was 219.2MB in the beginning and 217.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 527.30ms. Allocated memory is still 253.8MB. Free memory was 217.6MB in the beginning and 187.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6050.86ms. Allocated memory was 253.8MB in the beginning and 311.4MB in the end (delta: 57.7MB). Free memory was 187.2MB in the beginning and 105.2MB in the end (delta: 82.0MB). Peak memory consumption was 139.7MB. 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: 2.7s, 109 PlacesBefore, 23 PlacesAfterwards, 111 TransitionsBefore, 19 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 111 TotalNumberOfCompositions, 953 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 796, independent: 759, independent conditional: 0, independent unconditional: 759, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 495, independent: 482, independent conditional: 0, independent unconditional: 482, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 495, independent: 482, independent conditional: 0, independent unconditional: 482, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 796, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 495, unknown conditional: 0, unknown unconditional: 495] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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}] [L62] 2 int i=0; VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=0, i=0] [L83] 0 \read(t1) VAL [A={-2:0}, N=1, counter=0, t1={5:0}, t2={3: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=-3, i=1, tmp=-3] [L49] COND FALSE 1 !(i