/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/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:43:50,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:43:50,077 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 11:43:50,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:43:50,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:43:50,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:43:50,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:43:50,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:43:50,110 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:43:50,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:43:50,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:43:50,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:43:50,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:43:50,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:43:50,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:43:50,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:43:50,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:43:50,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:43:50,115 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:43:50,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:43:50,115 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:43:50,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:43:50,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:43:50,116 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:43:50,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:43:50,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:43:50,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:43:50,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:43:50,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:43:50,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:43:50,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:43:50,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:43:50,118 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 11:43:50,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:43:50,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:43:50,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:43:50,324 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:43:50,325 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:43:50,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-11-17 11:43:51,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:43:51,552 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:43:51,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-11-17 11:43:51,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5e8f7c/9b30a1fd139d4df399b15c035583ff05/FLAG6f3b86469 [2023-11-17 11:43:51,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5e8f7c/9b30a1fd139d4df399b15c035583ff05 [2023-11-17 11:43:51,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:43:51,579 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:43:51,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:43:51,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:43:51,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:43:51,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe504e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51, skipping insertion in model container [2023-11-17 11:43:51,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,606 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:43:51,726 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/bench-exp2x3.wvr.c[2289,2302] [2023-11-17 11:43:51,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:43:51,742 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:43:51,765 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/bench-exp2x3.wvr.c[2289,2302] [2023-11-17 11:43:51,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:43:51,777 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:43:51,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51 WrapperNode [2023-11-17 11:43:51,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:43:51,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:43:51,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:43:51,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:43:51,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,803 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-11-17 11:43:51,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:43:51,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:43:51,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:43:51,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:43:51,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:43:51,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:43:51,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:43:51,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:43:51,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (1/1) ... [2023-11-17 11:43:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:43:51,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:51,873 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 11:43:51,875 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 11:43:51,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 11:43:51,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 11:43:51,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 11:43:51,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 11:43:51,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:43:51,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:43:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:43:51,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:43:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:43:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:43:51,897 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 11:43:51,981 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:43:51,982 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:43:52,165 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:43:52,296 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:43:52,298 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 11:43:52,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:43:52 BoogieIcfgContainer [2023-11-17 11:43:52,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:43:52,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:43:52,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:43:52,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:43:52,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:43:51" (1/3) ... [2023-11-17 11:43:52,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d28b283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:43:52, skipping insertion in model container [2023-11-17 11:43:52,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:51" (2/3) ... [2023-11-17 11:43:52,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d28b283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:43:52, skipping insertion in model container [2023-11-17 11:43:52,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:43:52" (3/3) ... [2023-11-17 11:43:52,307 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-11-17 11:43:52,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:43:52,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:43:52,320 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:43:52,367 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-17 11:43:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 98 flow [2023-11-17 11:43:52,424 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-11-17 11:43:52,424 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 11:43:52,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-11-17 11:43:52,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 35 transitions, 98 flow [2023-11-17 11:43:52,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2023-11-17 11:43:52,432 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:43:52,444 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 84 flow [2023-11-17 11:43:52,446 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 84 flow [2023-11-17 11:43:52,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 84 flow [2023-11-17 11:43:52,464 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-11-17 11:43:52,465 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 11:43:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-11-17 11:43:52,467 INFO L119 LiptonReduction]: Number of co-enabled transitions 276 [2023-11-17 11:43:52,508 INFO L134 LiptonReduction]: Checked pairs total: 224 [2023-11-17 11:43:52,508 INFO L136 LiptonReduction]: Total number of compositions: 1 [2023-11-17 11:43:52,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:43:52,535 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;@24fc9cb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:43:52,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:43:52,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:43:52,550 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2023-11-17 11:43:52,551 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 11:43:52,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:52,551 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] [2023-11-17 11:43:52,552 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 2 more)] === [2023-11-17 11:43:52,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1834572563, now seen corresponding path program 1 times [2023-11-17 11:43:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256719324] [2023-11-17 11:43:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:53,033 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 11:43:53,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256719324] [2023-11-17 11:43:53,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256719324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:53,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:43:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825544101] [2023-11-17 11:43:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:53,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:43:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:43:53,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:43:53,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:53,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 11:43:53,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:53,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:53,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:53,330 INFO L124 PetriNetUnfolderBase]: 1537/1954 cut-off events. [2023-11-17 11:43:53,330 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-11-17 11:43:53,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6388 event pairs, 141 based on Foata normal form. 1/1133 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-11-17 11:43:53,347 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-11-17 11:43:53,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-11-17 11:43:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:43:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:43:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2023-11-17 11:43:53,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2023-11-17 11:43:53,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 75 transitions. [2023-11-17 11:43:53,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 75 transitions. [2023-11-17 11:43:53,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:53,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 75 transitions. [2023-11-17 11:43:53,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 11:43:53,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 11:43:53,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 11:43:53,367 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 75 transitions. [2023-11-17 11:43:53,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-11-17 11:43:53,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-17 11:43:53,376 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-11-17 11:43:53,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-11-17 11:43:53,381 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-11-17 11:43:53,381 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-11-17 11:43:53,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 11:43:53,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:53,382 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 11:43:53,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:43:53,382 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 2 more)] === [2023-11-17 11:43:53,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1399762916, now seen corresponding path program 1 times [2023-11-17 11:43:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:53,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324744579] [2023-11-17 11:43:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324744579] [2023-11-17 11:43:53,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324744579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:53,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:53,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358443169] [2023-11-17 11:43:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:53,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:53,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:53,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:53,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:53,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:53,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:53,808 INFO L124 PetriNetUnfolderBase]: 1843/2366 cut-off events. [2023-11-17 11:43:53,808 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2023-11-17 11:43:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2366 events. 1843/2366 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8365 event pairs, 139 based on Foata normal form. 34/2394 useless extension candidates. Maximal degree in co-relation 1448. Up to 967 conditions per place. [2023-11-17 11:43:53,822 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 72 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-11-17 11:43:53,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 86 transitions, 413 flow [2023-11-17 11:43:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-17 11:43:53,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2023-11-17 11:43:53,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-17 11:43:53,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-17 11:43:53,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:53,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-17 11:43:53,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:53,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:53,830 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:53,830 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 121 transitions. [2023-11-17 11:43:53,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 86 transitions, 413 flow [2023-11-17 11:43:53,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 86 transitions, 405 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:53,833 INFO L231 Difference]: Finished difference. Result has 38 places, 40 transitions, 159 flow [2023-11-17 11:43:53,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=38, PETRI_TRANSITIONS=40} [2023-11-17 11:43:53,834 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-11-17 11:43:53,835 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 159 flow [2023-11-17 11:43:53,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:53,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:53,835 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 11:43:53,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:43:53,836 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 2 more)] === [2023-11-17 11:43:53,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1460739132, now seen corresponding path program 1 times [2023-11-17 11:43:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694287449] [2023-11-17 11:43:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694287449] [2023-11-17 11:43:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694287449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:53,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:53,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882857958] [2023-11-17 11:43:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:53,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:53,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:53,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:53,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:53,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:53,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:53,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,172 INFO L124 PetriNetUnfolderBase]: 2211/2943 cut-off events. [2023-11-17 11:43:54,172 INFO L125 PetriNetUnfolderBase]: For 3566/3566 co-relation queries the response was YES. [2023-11-17 11:43:54,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8993 conditions, 2943 events. 2211/2943 cut-off events. For 3566/3566 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 11946 event pairs, 316 based on Foata normal form. 80/2997 useless extension candidates. Maximal degree in co-relation 2808. Up to 1265 conditions per place. [2023-11-17 11:43:54,189 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 90 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2023-11-17 11:43:54,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 102 transitions, 613 flow [2023-11-17 11:43:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2023-11-17 11:43:54,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6611111111111111 [2023-11-17 11:43:54,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 119 transitions. [2023-11-17 11:43:54,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 119 transitions. [2023-11-17 11:43:54,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 119 transitions. [2023-11-17 11:43:54,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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 11:43:54,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:54,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:54,195 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 159 flow. Second operand 5 states and 119 transitions. [2023-11-17 11:43:54,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 102 transitions, 613 flow [2023-11-17 11:43:54,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 102 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:43:54,200 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 214 flow [2023-11-17 11:43:54,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-11-17 11:43:54,201 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-11-17 11:43:54,201 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 214 flow [2023-11-17 11:43:54,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:54,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,202 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 11:43:54,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:43:54,202 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 2 more)] === [2023-11-17 11:43:54,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 905606435, now seen corresponding path program 1 times [2023-11-17 11:43:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439113935] [2023-11-17 11:43:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439113935] [2023-11-17 11:43:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439113935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495496772] [2023-11-17 11:43:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:54,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:54,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:54,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:54,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:54,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:54,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,537 INFO L124 PetriNetUnfolderBase]: 2149/2851 cut-off events. [2023-11-17 11:43:54,537 INFO L125 PetriNetUnfolderBase]: For 5352/5352 co-relation queries the response was YES. [2023-11-17 11:43:54,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10393 conditions, 2851 events. 2149/2851 cut-off events. For 5352/5352 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11428 event pairs, 165 based on Foata normal form. 66/2913 useless extension candidates. Maximal degree in co-relation 5282. Up to 1169 conditions per place. [2023-11-17 11:43:54,553 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 88 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2023-11-17 11:43:54,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 637 flow [2023-11-17 11:43:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2023-11-17 11:43:54,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-17 11:43:54,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 120 transitions. [2023-11-17 11:43:54,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 120 transitions. [2023-11-17 11:43:54,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 120 transitions. [2023-11-17 11:43:54,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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 11:43:54,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:54,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:54,557 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 214 flow. Second operand 5 states and 120 transitions. [2023-11-17 11:43:54,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 637 flow [2023-11-17 11:43:54,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 100 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:43:54,566 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 228 flow [2023-11-17 11:43:54,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-11-17 11:43:54,568 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-11-17 11:43:54,568 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 228 flow [2023-11-17 11:43:54,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:54,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,569 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 11:43:54,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:43:54,569 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 2 more)] === [2023-11-17 11:43:54,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -754712516, now seen corresponding path program 2 times [2023-11-17 11:43:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725270451] [2023-11-17 11:43:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725270451] [2023-11-17 11:43:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725270451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024834251] [2023-11-17 11:43:54,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:54,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:54,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:54,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:54,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,889 INFO L124 PetriNetUnfolderBase]: 1931/2568 cut-off events. [2023-11-17 11:43:54,889 INFO L125 PetriNetUnfolderBase]: For 5502/5502 co-relation queries the response was YES. [2023-11-17 11:43:54,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9922 conditions, 2568 events. 1931/2568 cut-off events. For 5502/5502 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9833 event pairs, 98 based on Foata normal form. 38/2579 useless extension candidates. Maximal degree in co-relation 5648. Up to 1021 conditions per place. [2023-11-17 11:43:54,912 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 90 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2023-11-17 11:43:54,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 105 transitions, 738 flow [2023-11-17 11:43:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-17 11:43:54,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2023-11-17 11:43:54,913 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-17 11:43:54,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-17 11:43:54,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-17 11:43:54,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 11:43:54,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:54,915 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:54,915 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 228 flow. Second operand 5 states and 117 transitions. [2023-11-17 11:43:54,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 105 transitions, 738 flow [2023-11-17 11:43:54,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 105 transitions, 721 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:54,921 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 282 flow [2023-11-17 11:43:54,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-17 11:43:54,923 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-11-17 11:43:54,923 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 282 flow [2023-11-17 11:43:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:54,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,924 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 11:43:54,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:43:54,924 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 2 more)] === [2023-11-17 11:43:54,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2126908448, now seen corresponding path program 2 times [2023-11-17 11:43:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222905201] [2023-11-17 11:43:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222905201] [2023-11-17 11:43:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222905201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:54,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413127168] [2023-11-17 11:43:54,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:54,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:54,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:54,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:54,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:54,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:55,232 INFO L124 PetriNetUnfolderBase]: 1843/2474 cut-off events. [2023-11-17 11:43:55,233 INFO L125 PetriNetUnfolderBase]: For 6459/6459 co-relation queries the response was YES. [2023-11-17 11:43:55,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10331 conditions, 2474 events. 1843/2474 cut-off events. For 6459/6459 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10145 event pairs, 435 based on Foata normal form. 92/2555 useless extension candidates. Maximal degree in co-relation 5843. Up to 1377 conditions per place. [2023-11-17 11:43:55,252 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 106 selfloop transitions, 8 changer transitions 0/118 dead transitions. [2023-11-17 11:43:55,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 118 transitions, 881 flow [2023-11-17 11:43:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-17 11:43:55,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2023-11-17 11:43:55,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-17 11:43:55,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-17 11:43:55,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:55,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-17 11:43:55,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:55,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:55,255 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 282 flow. Second operand 5 states and 121 transitions. [2023-11-17 11:43:55,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 118 transitions, 881 flow [2023-11-17 11:43:55,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 118 transitions, 844 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:55,262 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 319 flow [2023-11-17 11:43:55,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-17 11:43:55,264 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-11-17 11:43:55,264 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 319 flow [2023-11-17 11:43:55,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:55,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:55,265 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 11:43:55,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:43:55,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:43:55,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash -622023409, now seen corresponding path program 1 times [2023-11-17 11:43:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732164775] [2023-11-17 11:43:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732164775] [2023-11-17 11:43:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732164775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:55,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199152593] [2023-11-17 11:43:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:55,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:55,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:55,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:55,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:55,576 INFO L124 PetriNetUnfolderBase]: 1801/2437 cut-off events. [2023-11-17 11:43:55,577 INFO L125 PetriNetUnfolderBase]: For 7698/7704 co-relation queries the response was YES. [2023-11-17 11:43:55,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 2437 events. 1801/2437 cut-off events. For 7698/7704 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9627 event pairs, 75 based on Foata normal form. 43/2460 useless extension candidates. Maximal degree in co-relation 6684. Up to 1137 conditions per place. [2023-11-17 11:43:55,590 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 99 selfloop transitions, 8 changer transitions 4/115 dead transitions. [2023-11-17 11:43:55,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 115 transitions, 921 flow [2023-11-17 11:43:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2023-11-17 11:43:55,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2023-11-17 11:43:55,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 116 transitions. [2023-11-17 11:43:55,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 116 transitions. [2023-11-17 11:43:55,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:55,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 116 transitions. [2023-11-17 11:43:55,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 11:43:55,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:55,593 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:55,593 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 319 flow. Second operand 5 states and 116 transitions. [2023-11-17 11:43:55,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 115 transitions, 921 flow [2023-11-17 11:43:55,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 896 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:55,600 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 326 flow [2023-11-17 11:43:55,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-17 11:43:55,601 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-11-17 11:43:55,601 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 326 flow [2023-11-17 11:43:55,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:55,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:55,602 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 11:43:55,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:43:55,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:43:55,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1511131137, now seen corresponding path program 2 times [2023-11-17 11:43:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832352295] [2023-11-17 11:43:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:55,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832352295] [2023-11-17 11:43:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832352295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490485137] [2023-11-17 11:43:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:55,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:55,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:55,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:55,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:55,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:55,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:55,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:55,920 INFO L124 PetriNetUnfolderBase]: 1725/2373 cut-off events. [2023-11-17 11:43:55,920 INFO L125 PetriNetUnfolderBase]: For 8045/8051 co-relation queries the response was YES. [2023-11-17 11:43:55,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10861 conditions, 2373 events. 1725/2373 cut-off events. For 8045/8051 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9808 event pairs, 293 based on Foata normal form. 77/2430 useless extension candidates. Maximal degree in co-relation 6708. Up to 1307 conditions per place. [2023-11-17 11:43:55,936 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 101 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2023-11-17 11:43:55,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 923 flow [2023-11-17 11:43:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-17 11:43:55,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6277777777777778 [2023-11-17 11:43:55,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-17 11:43:55,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-17 11:43:55,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:55,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-17 11:43:55,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:55,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:55,939 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 326 flow. Second operand 5 states and 113 transitions. [2023-11-17 11:43:55,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 923 flow [2023-11-17 11:43:55,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 910 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:55,948 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 366 flow [2023-11-17 11:43:55,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2023-11-17 11:43:55,949 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2023-11-17 11:43:55,950 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 366 flow [2023-11-17 11:43:55,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:55,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:55,950 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 11:43:55,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:43:55,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:43:55,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1356359585, now seen corresponding path program 2 times [2023-11-17 11:43:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380125590] [2023-11-17 11:43:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380125590] [2023-11-17 11:43:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380125590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:56,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24966247] [2023-11-17 11:43:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:56,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:56,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:43:56,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:56,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:56,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:43:56,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:56,257 INFO L124 PetriNetUnfolderBase]: 1657/2288 cut-off events. [2023-11-17 11:43:56,258 INFO L125 PetriNetUnfolderBase]: For 8327/8327 co-relation queries the response was YES. [2023-11-17 11:43:56,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11113 conditions, 2288 events. 1657/2288 cut-off events. For 8327/8327 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9648 event pairs, 481 based on Foata normal form. 68/2345 useless extension candidates. Maximal degree in co-relation 9769. Up to 1331 conditions per place. [2023-11-17 11:43:56,272 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 117 selfloop transitions, 8 changer transitions 0/129 dead transitions. [2023-11-17 11:43:56,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 1114 flow [2023-11-17 11:43:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-17 11:43:56,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2023-11-17 11:43:56,274 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-17 11:43:56,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-17 11:43:56,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:56,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-17 11:43:56,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 11:43:56,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:56,275 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 11:43:56,275 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 366 flow. Second operand 5 states and 117 transitions. [2023-11-17 11:43:56,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 1114 flow [2023-11-17 11:43:56,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 1056 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-17 11:43:56,285 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 403 flow [2023-11-17 11:43:56,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2023-11-17 11:43:56,285 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2023-11-17 11:43:56,286 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 403 flow [2023-11-17 11:43:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 11:43:56,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:56,286 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 11:43:56,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:43:56,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:43:56,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 277160222, now seen corresponding path program 1 times [2023-11-17 11:43:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600499189] [2023-11-17 11:43:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600499189] [2023-11-17 11:43:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600499189] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:43:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340451078] [2023-11-17 11:43:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:56,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:43:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:56,765 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 11:43:56,769 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 11:43:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:57,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:43:57,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:44:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:44:31,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:44:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:44:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340451078] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:44:52,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:44:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-17 11:44:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371281606] [2023-11-17 11:44:52,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:44:52,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 11:44:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:44:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 11:44:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=165, Unknown=23, NotChecked=0, Total=240 [2023-11-17 11:44:52,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:44:52,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 403 flow. Second operand has 16 states, 16 states have (on average 12.9375) internal successors, (207), 16 states have internal predecessors, (207), 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 11:44:52,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:44:52,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:44:52,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:44:54,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:44:55,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:18,601 WARN L293 SmtUtils]: Spent 17.29s on a formula simplification. DAG size of input: 80 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:45:20,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:23,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:37,782 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 69 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:45:38,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:40,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:42,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:45,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:47,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:48,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:51,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:53,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:58,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:01,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:08,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:13,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:15,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:17,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:20,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:22,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:26,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:28,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:30,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:32,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:34,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:36,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:08,250 WARN L293 SmtUtils]: Spent 22.36s on a formula simplification. DAG size of input: 57 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:47:11,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:13,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:15,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:17,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:19,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:21,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:23,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:35,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:36,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:38,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:41,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:43,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:45,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:47,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:49,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:51,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:53,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:55,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:57,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:59,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:01,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:03,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:05,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:07,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:09,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:11,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:13,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:15,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:17,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:19,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:21,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:23,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:25,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:27,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:29,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:33,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:35,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:37,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:41,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:47,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:49,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:53,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:55,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:58,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:00,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:02,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:04,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:06,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:09,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:12,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:17,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:19,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:21,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:23,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:25,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:27,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:29,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:31,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:33,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:35,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:39,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:41,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:42,582 INFO L124 PetriNetUnfolderBase]: 2492/3482 cut-off events. [2023-11-17 11:49:42,583 INFO L125 PetriNetUnfolderBase]: For 11673/11673 co-relation queries the response was YES. [2023-11-17 11:49:42,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16774 conditions, 3482 events. 2492/3482 cut-off events. For 11673/11673 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15911 event pairs, 351 based on Foata normal form. 17/3488 useless extension candidates. Maximal degree in co-relation 15196. Up to 2189 conditions per place. [2023-11-17 11:49:42,604 INFO L140 encePairwiseOnDemand]: 19/36 looper letters, 180 selfloop transitions, 59 changer transitions 27/270 dead transitions. [2023-11-17 11:49:42,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 270 transitions, 2132 flow [2023-11-17 11:49:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 11:49:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 11:49:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 330 transitions. [2023-11-17 11:49:42,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2023-11-17 11:49:42,606 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 330 transitions. [2023-11-17 11:49:42,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 330 transitions. [2023-11-17 11:49:42,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:49:42,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 330 transitions. [2023-11-17 11:49:42,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 23.571428571428573) internal successors, (330), 14 states have internal predecessors, (330), 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 11:49:42,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 36.0) internal successors, (540), 15 states have internal predecessors, (540), 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 11:49:42,607 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 36.0) internal successors, (540), 15 states have internal predecessors, (540), 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 11:49:42,607 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 403 flow. Second operand 14 states and 330 transitions. [2023-11-17 11:49:42,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 270 transitions, 2132 flow [2023-11-17 11:49:42,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 270 transitions, 2083 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-17 11:49:42,621 INFO L231 Difference]: Finished difference. Result has 92 places, 113 transitions, 1149 flow [2023-11-17 11:49:42,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1149, PETRI_PLACES=92, PETRI_TRANSITIONS=113} [2023-11-17 11:49:42,622 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2023-11-17 11:49:42,622 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 113 transitions, 1149 flow [2023-11-17 11:49:42,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.9375) internal successors, (207), 16 states have internal predecessors, (207), 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 11:49:42,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:49:42,622 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 11:49:42,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 11:49:42,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 11:49:42,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:49:42,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:49:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1015765006, now seen corresponding path program 2 times [2023-11-17 11:49:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:49:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677335543] [2023-11-17 11:49:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:49:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:49:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:49:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:49:43,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:49:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677335543] [2023-11-17 11:49:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677335543] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:49:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662851383] [2023-11-17 11:49:43,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:49:43,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:49:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:49:43,179 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 11:49:43,181 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 11:49:43,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:49:43,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:49:43,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:49:43,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:50:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:50:17,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:50:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:50:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662851383] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:50:38,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:50:38,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-17 11:50:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417664137] [2023-11-17 11:50:38,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:50:38,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 11:50:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:50:38,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 11:50:38,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=159, Unknown=20, NotChecked=0, Total=240 [2023-11-17 11:50:38,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2023-11-17 11:50:38,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 113 transitions, 1149 flow. Second operand has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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 11:50:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:50:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2023-11-17 11:50:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:50:57,998 WARN L293 SmtUtils]: Spent 16.30s on a formula simplification. DAG size of input: 70 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:51:00,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:02,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:07,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:09,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:13,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:15,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:16,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:18,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:20,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:22,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:24,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:26,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:29,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:31,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:33,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:35,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* 4294967296 (div c_~x3~0 4294967296)))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse2 (mod (* (div (* (- 1) c_~x4~0) 2) 4294967295) 4294967296)) (.cse3 (+ .cse7 c_~x4~0)) (.cse5 (* 4294967296 (div c_~n~0 4294967296))) (.cse6 (* (div c_~x4~0 4294967296) 4294967296)) (.cse1 (mod (div c_~x3~0 2) 4294967296))) (and (= .cse0 (mod c_~x2~0 4294967296)) (= .cse1 .cse2) (<= 1 .cse0) (<= (+ .cse2 1) (mod c_~n~0 4294967296)) (let ((.cse4 (+ c_~x3~0 .cse6))) (or (and (or (= .cse3 .cse4) (< (+ 3 .cse5 c_~x4~0) (+ c_~n~0 .cse6))) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (< .cse4 .cse3))) (or (< .cse3 (+ c_~x3~0 .cse6 1)) (< (+ c_~x3~0 .cse5 4294967297 .cse6) (+ .cse7 c_~n~0 c_~x4~0))) (= (mod c_~x4~0 2) 0) (<= 1 .cse1) (= (mod c_~x3~0 2) 0)))) is different from false [2023-11-17 11:51:37,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:40,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:42,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:44,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:58,049 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 54 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:52:00,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:02,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:03,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:09,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:12,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:15,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:17,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:19,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:21,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:23,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:24,121 INFO L124 PetriNetUnfolderBase]: 3383/4702 cut-off events. [2023-11-17 11:52:24,121 INFO L125 PetriNetUnfolderBase]: For 22417/22417 co-relation queries the response was YES. [2023-11-17 11:52:24,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27090 conditions, 4702 events. 3383/4702 cut-off events. For 22417/22417 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22141 event pairs, 373 based on Foata normal form. 18/4709 useless extension candidates. Maximal degree in co-relation 26556. Up to 3265 conditions per place. [2023-11-17 11:52:24,158 INFO L140 encePairwiseOnDemand]: 21/36 looper letters, 189 selfloop transitions, 120 changer transitions 25/338 dead transitions. [2023-11-17 11:52:24,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 338 transitions, 3631 flow [2023-11-17 11:52:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 11:52:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 11:52:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 299 transitions. [2023-11-17 11:52:24,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2023-11-17 11:52:24,160 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 299 transitions. [2023-11-17 11:52:24,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 299 transitions. [2023-11-17 11:52:24,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:52:24,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 299 transitions. [2023-11-17 11:52:24,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 23.0) internal successors, (299), 13 states have internal predecessors, (299), 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 11:52:24,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 36.0) internal successors, (504), 14 states have internal predecessors, (504), 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 11:52:24,161 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 36.0) internal successors, (504), 14 states have internal predecessors, (504), 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 11:52:24,161 INFO L175 Difference]: Start difference. First operand has 92 places, 113 transitions, 1149 flow. Second operand 13 states and 299 transitions. [2023-11-17 11:52:24,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 338 transitions, 3631 flow [2023-11-17 11:52:24,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 338 transitions, 3434 flow, removed 96 selfloop flow, removed 1 redundant places. [2023-11-17 11:52:24,205 INFO L231 Difference]: Finished difference. Result has 112 places, 209 transitions, 2490 flow [2023-11-17 11:52:24,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2490, PETRI_PLACES=112, PETRI_TRANSITIONS=209} [2023-11-17 11:52:24,206 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 74 predicate places. [2023-11-17 11:52:24,206 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 209 transitions, 2490 flow [2023-11-17 11:52:24,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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 11:52:24,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:52:24,206 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 11:52:24,214 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 11:52:24,411 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,SelfDestructingSolverStorable10 [2023-11-17 11:52:24,417 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:52:24,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:52:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1578621774, now seen corresponding path program 3 times [2023-11-17 11:52:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:52:24,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47067884] [2023-11-17 11:52:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:52:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:52:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:52:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:52:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:52:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47067884] [2023-11-17 11:52:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47067884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:52:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125407094] [2023-11-17 11:52:24,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:52:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:52:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:52:24,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:52:24,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 11:52:25,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 11:52:25,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:52:25,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:52:25,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:53:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:53:20,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-11-17 11:53:30,489 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:53:30,498 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:53:31,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 11:53:31,709 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 11:53:31,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-11-17 11:53:31,717 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:53:31,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:53:31,717 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-11-17 11:53:31,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-17 11:53:31,718 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:53:31,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:53:31,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-17 11:53:31,719 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1] [2023-11-17 11:53:31,722 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:53:31,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:53:31,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:53:31 BasicIcfg [2023-11-17 11:53:31,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:53:31,724 INFO L158 Benchmark]: Toolchain (without parser) took 580144.70ms. Allocated memory was 197.1MB in the beginning and 388.0MB in the end (delta: 190.8MB). Free memory was 145.5MB in the beginning and 311.1MB in the end (delta: -165.5MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,724 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:53:31,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.56ms. Allocated memory is still 197.1MB. Free memory was 145.5MB in the beginning and 134.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.02ms. Allocated memory is still 197.1MB. Free memory was 134.0MB in the beginning and 132.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,725 INFO L158 Benchmark]: Boogie Preprocessor took 35.11ms. Allocated memory is still 197.1MB. Free memory was 132.4MB in the beginning and 130.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,725 INFO L158 Benchmark]: RCFGBuilder took 460.42ms. Allocated memory is still 197.1MB. Free memory was 130.9MB in the beginning and 98.4MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,725 INFO L158 Benchmark]: TraceAbstraction took 579422.30ms. Allocated memory was 197.1MB in the beginning and 388.0MB in the end (delta: 190.8MB). Free memory was 97.8MB in the beginning and 311.1MB in the end (delta: -213.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:53:31,726 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 197.1MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.56ms. Allocated memory is still 197.1MB. Free memory was 145.5MB in the beginning and 134.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.02ms. Allocated memory is still 197.1MB. Free memory was 134.0MB in the beginning and 132.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.11ms. Allocated memory is still 197.1MB. Free memory was 132.4MB in the beginning and 130.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.42ms. Allocated memory is still 197.1MB. Free memory was 130.9MB in the beginning and 98.4MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 579422.30ms. Allocated memory was 197.1MB in the beginning and 388.0MB in the end (delta: 190.8MB). Free memory was 97.8MB in the beginning and 311.1MB in the end (delta: -213.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 112, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 112, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 112, unknown conditional: 0, unknown unconditional: 112] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 48 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 579.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 398.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 101 mSolverCounterUnknown, 619 SdHoareTripleChecker+Valid, 270.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 619 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 269.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 192 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2172 IncrementalHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 0 mSDtfsCounter, 2172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 228.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2490occurred in iteration=11, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 111.5s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 9502 SizeOfPredicates, 4 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 8/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown