/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:11:06,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:11:06,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 12:11:06,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:11:06,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:11:06,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:11:06,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:11:06,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:11:06,598 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:11:06,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:11:06,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:11:06,601 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:11:06,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:11:06,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:11:06,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:11:06,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:11:06,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:11:06,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:11:06,603 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:11:06,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:11:06,604 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:11:06,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:11:06,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:11:06,604 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:11:06,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:11:06,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:11:06,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:11:06,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:11:06,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:11:06,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:11:06,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:11:06,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:11:06,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:11:06,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:11:06,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:11:06,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:11:06,816 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:11:06,816 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:11:06,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-11-17 12:11:07,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:11:08,081 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:11:08,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-11-17 12:11:08,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be944bd3/553b274625e14045bac6476800880bf1/FLAGda64a2487 [2023-11-17 12:11:08,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be944bd3/553b274625e14045bac6476800880bf1 [2023-11-17 12:11:08,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:11:08,109 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:11:08,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:11:08,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:11:08,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:11:08,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b3910c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08, skipping insertion in model container [2023-11-17 12:11:08,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,138 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:11:08,261 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-dot-product-alt.wvr.c[3221,3234] [2023-11-17 12:11:08,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:11:08,273 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:11:08,293 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-dot-product-alt.wvr.c[3221,3234] [2023-11-17 12:11:08,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:11:08,302 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:11:08,302 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:11:08,307 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:11:08,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08 WrapperNode [2023-11-17 12:11:08,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:11:08,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:11:08,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:11:08,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:11:08,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,346 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 378 [2023-11-17 12:11:08,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:11:08,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:11:08,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:11:08,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:11:08,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:11:08,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:11:08,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:11:08,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:11:08,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (1/1) ... [2023-11-17 12:11:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:11:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:08,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 12:11:08,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 12:11:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:11:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-17 12:11:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:11:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:11:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:11:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-17 12:11:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:11:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:11:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:11:08,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 12:11:08,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 12:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:11:08,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:11:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:11:08,529 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 12:11:08,624 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:11:08,626 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:11:09,146 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:11:09,518 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:11:09,518 INFO L307 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-17 12:11:09,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:11:09 BoogieIcfgContainer [2023-11-17 12:11:09,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:11:09,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:11:09,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:11:09,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:11:09,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:11:08" (1/3) ... [2023-11-17 12:11:09,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c68210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:11:09, skipping insertion in model container [2023-11-17 12:11:09,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:11:08" (2/3) ... [2023-11-17 12:11:09,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c68210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:11:09, skipping insertion in model container [2023-11-17 12:11:09,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:11:09" (3/3) ... [2023-11-17 12:11:09,526 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2023-11-17 12:11:09,539 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:11:09,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:11:09,540 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:11:09,601 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 12:11:09,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2023-11-17 12:11:09,661 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2023-11-17 12:11:09,661 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 12:11:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 7/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-11-17 12:11:09,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2023-11-17 12:11:09,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2023-11-17 12:11:09,678 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:11:09,693 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 37 transitions, 92 flow [2023-11-17 12:11:09,696 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 92 flow [2023-11-17 12:11:09,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 92 flow [2023-11-17 12:11:09,711 INFO L124 PetriNetUnfolderBase]: 7/37 cut-off events. [2023-11-17 12:11:09,712 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 12:11:09,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 7/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-11-17 12:11:09,713 INFO L119 LiptonReduction]: Number of co-enabled transitions 300 [2023-11-17 12:11:10,530 INFO L134 LiptonReduction]: Checked pairs total: 475 [2023-11-17 12:11:10,531 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-11-17 12:11:10,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:11:10,545 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;@7a6d3030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:11:10,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 12:11:10,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:11:10,552 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2023-11-17 12:11:10,552 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 12:11:10,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:10,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:10,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:11:10,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 888274046, now seen corresponding path program 1 times [2023-11-17 12:11:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:10,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054895412] [2023-11-17 12:11:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054895412] [2023-11-17 12:11:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054895412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:11:11,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:11:11,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:11:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069906586] [2023-11-17 12:11:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:11:11,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:11:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:11:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:11:11,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2023-11-17 12:11:11,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:11,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2023-11-17 12:11:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:11,315 INFO L124 PetriNetUnfolderBase]: 374/552 cut-off events. [2023-11-17 12:11:11,316 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-17 12:11:11,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 552 events. 374/552 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1555 event pairs, 253 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 936. Up to 545 conditions per place. [2023-11-17 12:11:11,322 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2023-11-17 12:11:11,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 178 flow [2023-11-17 12:11:11,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:11:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:11:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2023-11-17 12:11:11,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26956521739130435 [2023-11-17 12:11:11,332 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 62 transitions. [2023-11-17 12:11:11,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 62 transitions. [2023-11-17 12:11:11,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:11,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 62 transitions. [2023-11-17 12:11:11,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,344 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 82 flow. Second operand 5 states and 62 transitions. [2023-11-17 12:11:11,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 178 flow [2023-11-17 12:11:11,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 12:11:11,348 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 98 flow [2023-11-17 12:11:11,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2023-11-17 12:11:11,351 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-11-17 12:11:11,352 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 98 flow [2023-11-17 12:11:11,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:11,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:11,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:11:11,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:11:11,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash 187969622, now seen corresponding path program 1 times [2023-11-17 12:11:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993821387] [2023-11-17 12:11:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993821387] [2023-11-17 12:11:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993821387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245717067] [2023-11-17 12:11:11,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:11,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:11:11,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 12:11:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:11,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:11:11,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:11:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:11,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:11:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245717067] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:11,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:11:11,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-17 12:11:11,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705690040] [2023-11-17 12:11:11,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:11:11,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:11:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:11:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-17 12:11:11,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2023-11-17 12:11:11,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:11,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2023-11-17 12:11:11,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:11,916 INFO L124 PetriNetUnfolderBase]: 449/658 cut-off events. [2023-11-17 12:11:11,916 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:11:11,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 658 events. 449/658 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2060 event pairs, 191 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 1337. Up to 399 conditions per place. [2023-11-17 12:11:11,921 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-11-17 12:11:11,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 220 flow [2023-11-17 12:11:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:11:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:11:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2023-11-17 12:11:11,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29130434782608694 [2023-11-17 12:11:11,922 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 67 transitions. [2023-11-17 12:11:11,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 67 transitions. [2023-11-17 12:11:11,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:11,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 67 transitions. [2023-11-17 12:11:11,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,924 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 98 flow. Second operand 5 states and 67 transitions. [2023-11-17 12:11:11,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 220 flow [2023-11-17 12:11:11,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 210 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 12:11:11,925 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 111 flow [2023-11-17 12:11:11,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-11-17 12:11:11,926 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-11-17 12:11:11,926 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 111 flow [2023-11-17 12:11:11,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:11,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:11,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:11,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-17 12:11:12,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:12,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:11:12,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1946444122, now seen corresponding path program 1 times [2023-11-17 12:11:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74349755] [2023-11-17 12:11:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:11:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:12,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74349755] [2023-11-17 12:11:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74349755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:11:12,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:11:12,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:11:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006448783] [2023-11-17 12:11:12,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:11:12,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:11:12,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:11:12,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:11:12,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2023-11-17 12:11:12,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:12,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2023-11-17 12:11:12,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:12,478 INFO L124 PetriNetUnfolderBase]: 567/826 cut-off events. [2023-11-17 12:11:12,478 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2023-11-17 12:11:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 826 events. 567/826 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2606 event pairs, 315 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 2000. Up to 648 conditions per place. [2023-11-17 12:11:12,482 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-11-17 12:11:12,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 259 flow [2023-11-17 12:11:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:11:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:11:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2023-11-17 12:11:12,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2023-11-17 12:11:12,483 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 63 transitions. [2023-11-17 12:11:12,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 63 transitions. [2023-11-17 12:11:12,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:12,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 63 transitions. [2023-11-17 12:11:12,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,485 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,485 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 111 flow. Second operand 4 states and 63 transitions. [2023-11-17 12:11:12,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 259 flow [2023-11-17 12:11:12,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 250 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 12:11:12,486 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 119 flow [2023-11-17 12:11:12,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-11-17 12:11:12,487 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-11-17 12:11:12,487 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 119 flow [2023-11-17 12:11:12,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:12,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:12,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:11:12,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:11:12,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1837454417, now seen corresponding path program 1 times [2023-11-17 12:11:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535544225] [2023-11-17 12:11:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:11:12,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535544225] [2023-11-17 12:11:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535544225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:11:12,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:11:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:11:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812789584] [2023-11-17 12:11:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:11:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:11:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:11:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:11:12,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2023-11-17 12:11:12,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:12,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2023-11-17 12:11:12,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:12,900 INFO L124 PetriNetUnfolderBase]: 613/915 cut-off events. [2023-11-17 12:11:12,900 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-11-17 12:11:12,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 915 events. 613/915 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2891 event pairs, 458 based on Foata normal form. 32/835 useless extension candidates. Maximal degree in co-relation 2387. Up to 821 conditions per place. [2023-11-17 12:11:12,905 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 36 selfloop transitions, 3 changer transitions 11/50 dead transitions. [2023-11-17 12:11:12,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 258 flow [2023-11-17 12:11:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:11:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:11:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2023-11-17 12:11:12,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3532608695652174 [2023-11-17 12:11:12,920 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 65 transitions. [2023-11-17 12:11:12,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 65 transitions. [2023-11-17 12:11:12,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:12,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 65 transitions. [2023-11-17 12:11:12,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,922 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,922 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 119 flow. Second operand 4 states and 65 transitions. [2023-11-17 12:11:12,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 258 flow [2023-11-17 12:11:12,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 12:11:12,924 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 135 flow [2023-11-17 12:11:12,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-11-17 12:11:12,925 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2023-11-17 12:11:12,925 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 135 flow [2023-11-17 12:11:12,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:12,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:12,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:12,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:11:12,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:11:12,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1503933155, now seen corresponding path program 1 times [2023-11-17 12:11:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987547804] [2023-11-17 12:11:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:11:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987547804] [2023-11-17 12:11:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987547804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:11:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:11:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:11:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111102310] [2023-11-17 12:11:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:11:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:11:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:11:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:11:13,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2023-11-17 12:11:13,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:13,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:13,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2023-11-17 12:11:13,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:13,385 INFO L124 PetriNetUnfolderBase]: 615/921 cut-off events. [2023-11-17 12:11:13,385 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2023-11-17 12:11:13,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 921 events. 615/921 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2894 event pairs, 458 based on Foata normal form. 45/915 useless extension candidates. Maximal degree in co-relation 2456. Up to 824 conditions per place. [2023-11-17 12:11:13,392 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 34 selfloop transitions, 4 changer transitions 15/53 dead transitions. [2023-11-17 12:11:13,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 290 flow [2023-11-17 12:11:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:11:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:11:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2023-11-17 12:11:13,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30869565217391304 [2023-11-17 12:11:13,395 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 71 transitions. [2023-11-17 12:11:13,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 71 transitions. [2023-11-17 12:11:13,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:13,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 71 transitions. [2023-11-17 12:11:13,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:13,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:13,398 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:13,398 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 135 flow. Second operand 5 states and 71 transitions. [2023-11-17 12:11:13,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 290 flow [2023-11-17 12:11:13,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 12:11:13,402 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 161 flow [2023-11-17 12:11:13,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-17 12:11:13,405 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-11-17 12:11:13,405 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 161 flow [2023-11-17 12:11:13,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:11:13,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:13,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:13,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 12:11:13,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:11:13,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1995843888, now seen corresponding path program 1 times [2023-11-17 12:11:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882271330] [2023-11-17 12:11:13,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:11:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882271330] [2023-11-17 12:11:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882271330] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254995555] [2023-11-17 12:11:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:15,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:11:15,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 12:11:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:15,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-17 12:11:15,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:11:15,808 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 23 treesize of output 1 [2023-11-17 12:11:15,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:16,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:16,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:11:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:11:16,255 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:11:16,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2023-11-17 12:11:16,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:16,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2023-11-17 12:11:16,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-17 12:11:16,512 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-17 12:11:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2023-11-17 12:11:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:11:16,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:11:16,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:11:16,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 96 [2023-11-17 12:11:27,713 WARN L293 SmtUtils]: Spent 10.58s on a formula simplification that was a NOOP. DAG size: 857 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-17 12:11:27,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:11:27,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 32 new quantified variables, introduced 190 case distinctions, treesize of input 2199 treesize of output 5683 [2023-11-17 12:11:33,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:11:33,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 18 new quantified variables, introduced 66 case distinctions, treesize of input 5838 treesize of output 5692 [2023-11-17 12:11:34,474 INFO L224 Elim1Store]: Index analysis took 107 ms [2023-11-17 12:11:39,635 WARN L293 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 313 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-17 12:11:39,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:11:39,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 18 new quantified variables, introduced 66 case distinctions, treesize of input 5107 treesize of output 5157 [2023-11-17 12:16:15,494 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 12:16:15,495 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 12:16:15,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-11-17 12:16:15,503 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 12:16:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 12:16:15,696 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-17 12:16:15,700 INFO L158 Benchmark]: Toolchain (without parser) took 307591.04ms. Allocated memory was 173.0MB in the beginning and 887.1MB in the end (delta: 714.1MB). Free memory was 109.8MB in the beginning and 449.6MB in the end (delta: -339.9MB). Peak memory consumption was 531.6MB. Max. memory is 8.0GB. [2023-11-17 12:16:15,700 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:16:15,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.62ms. Allocated memory is still 173.0MB. Free memory was 109.8MB in the beginning and 96.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 12:16:15,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 173.0MB. Free memory was 96.6MB in the beginning and 93.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 12:16:15,700 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory was 173.0MB in the beginning and 213.9MB in the end (delta: 40.9MB). Free memory was 93.5MB in the beginning and 180.2MB in the end (delta: -86.6MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-11-17 12:16:15,701 INFO L158 Benchmark]: RCFGBuilder took 1122.19ms. Allocated memory is still 213.9MB. Free memory was 180.1MB in the beginning and 124.2MB in the end (delta: 55.9MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2023-11-17 12:16:15,701 INFO L158 Benchmark]: TraceAbstraction took 306177.65ms. Allocated memory was 213.9MB in the beginning and 887.1MB in the end (delta: 673.2MB). Free memory was 123.2MB in the beginning and 449.6MB in the end (delta: -326.5MB). Peak memory consumption was 503.4MB. Max. memory is 8.0GB. [2023-11-17 12:16:15,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.62ms. Allocated memory is still 173.0MB. Free memory was 109.8MB in the beginning and 96.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 173.0MB. Free memory was 96.6MB in the beginning and 93.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.36ms. Allocated memory was 173.0MB in the beginning and 213.9MB in the end (delta: 40.9MB). Free memory was 93.5MB in the beginning and 180.2MB in the end (delta: -86.6MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1122.19ms. Allocated memory is still 213.9MB. Free memory was 180.1MB in the beginning and 124.2MB in the end (delta: 55.9MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. * TraceAbstraction took 306177.65ms. Allocated memory was 213.9MB in the beginning and 887.1MB in the end (delta: 673.2MB). Free memory was 123.2MB in the beginning and 449.6MB in the end (delta: -326.5MB). Peak memory consumption was 503.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 40 PlacesBefore, 35 PlacesAfterwards, 37 TransitionsBefore, 32 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 475 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 332, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 155, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 155, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 332, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 155, unknown conditional: 0, unknown unconditional: 155] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...