/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 13:28:06,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 13:28:06,416 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-VariableLbe.epf [2023-08-24 13:28:06,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 13:28:06,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 13:28:06,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 13:28:06,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 13:28:06,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 13:28:06,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 13:28:06,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 13:28:06,456 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 13:28:06,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 13:28:06,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 13:28:06,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 13:28:06,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 13:28:06,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 13:28:06,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 13:28:06,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 13:28:06,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 13:28:06,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 13:28:06,459 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 13:28:06,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 13:28:06,460 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 13:28:06,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 13:28:06,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 13:28:06,461 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 13:28:06,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 13:28:06,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 13:28:06,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 13:28:06,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 13:28:06,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 13:28:06,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 13:28:06,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 13:28:06,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 13:28:06,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 13:28:06,463 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 13:28:06,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 13:28:06,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 13:28:06,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 13:28:06,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 13:28:06,814 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 13:28:06,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-24 13:28:08,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 13:28:08,288 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 13:28:08,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-24 13:28:08,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e737d7e0/363a007b625f4dffb00846c551ed91a4/FLAGfee83e8c5 [2023-08-24 13:28:08,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e737d7e0/363a007b625f4dffb00846c551ed91a4 [2023-08-24 13:28:08,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 13:28:08,306 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 13:28:08,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 13:28:08,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 13:28:08,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 13:28:08,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d195a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08, skipping insertion in model container [2023-08-24 13:28:08,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 13:28:08,513 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-exp3x3-opt.wvr.c[2826,2839] [2023-08-24 13:28:08,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 13:28:08,529 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 13:28:08,567 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-exp3x3-opt.wvr.c[2826,2839] [2023-08-24 13:28:08,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 13:28:08,582 INFO L206 MainTranslator]: Completed translation [2023-08-24 13:28:08,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08 WrapperNode [2023-08-24 13:28:08,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 13:28:08,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 13:28:08,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 13:28:08,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 13:28:08,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,634 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2023-08-24 13:28:08,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 13:28:08,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 13:28:08,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 13:28:08,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 13:28:08,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 13:28:08,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 13:28:08,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 13:28:08,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 13:28:08,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (1/1) ... [2023-08-24 13:28:08,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 13:28:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:08,717 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-08-24 13:28:08,750 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-08-24 13:28:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 13:28:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 13:28:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 13:28:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 13:28:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 13:28:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 13:28:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 13:28:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 13:28:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 13:28:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 13:28:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 13:28:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 13:28:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 13:28:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 13:28:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 13:28:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 13:28:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 13:28:08,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 13:28:08,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 13:28:08,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 13:28:08,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 13:28:08,888 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 13:28:08,890 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 13:28:09,136 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 13:28:09,147 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 13:28:09,147 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-24 13:28:09,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:28:09 BoogieIcfgContainer [2023-08-24 13:28:09,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 13:28:09,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 13:28:09,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 13:28:09,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 13:28:09,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 01:28:08" (1/3) ... [2023-08-24 13:28:09,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763a21ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:28:09, skipping insertion in model container [2023-08-24 13:28:09,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:28:08" (2/3) ... [2023-08-24 13:28:09,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763a21ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:28:09, skipping insertion in model container [2023-08-24 13:28:09,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:28:09" (3/3) ... [2023-08-24 13:28:09,157 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-08-24 13:28:09,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 13:28:09,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 13:28:09,174 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 13:28:09,287 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-24 13:28:09,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2023-08-24 13:28:09,454 INFO L124 PetriNetUnfolderBase]: 14/163 cut-off events. [2023-08-24 13:28:09,454 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 13:28:09,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 163 events. 14/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-08-24 13:28:09,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2023-08-24 13:28:09,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 147 transitions, 330 flow [2023-08-24 13:28:09,472 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 13:28:09,484 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 147 transitions, 330 flow [2023-08-24 13:28:09,490 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 147 transitions, 330 flow [2023-08-24 13:28:09,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 147 transitions, 330 flow [2023-08-24 13:28:09,539 INFO L124 PetriNetUnfolderBase]: 14/147 cut-off events. [2023-08-24 13:28:09,539 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 13:28:09,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 147 events. 14/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-08-24 13:28:09,545 INFO L119 LiptonReduction]: Number of co-enabled transitions 2916 [2023-08-24 13:28:15,485 INFO L134 LiptonReduction]: Checked pairs total: 3543 [2023-08-24 13:28:15,485 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-24 13:28:15,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 13:28:15,516 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=LoopsAndPotentialCycles, 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;@57ced2bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 13:28:15,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 13:28:15,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 13:28:15,527 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-08-24 13:28:15,527 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 13:28:15,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:15,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:15,528 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 4 more)] === [2023-08-24 13:28:15,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 859190718, now seen corresponding path program 1 times [2023-08-24 13:28:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:15,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671294872] [2023-08-24 13:28:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 13:28:16,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671294872] [2023-08-24 13:28:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671294872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:16,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 13:28:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785594386] [2023-08-24 13:28:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 13:28:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 13:28:16,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 13:28:16,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 13:28:16,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-08-24 13:28:16,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:16,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 13:28:16,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:16,859 INFO L124 PetriNetUnfolderBase]: 3277/3973 cut-off events. [2023-08-24 13:28:16,859 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2023-08-24 13:28:16,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8270 conditions, 3973 events. 3277/3973 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10583 event pairs, 837 based on Foata normal form. 1/2272 useless extension candidates. Maximal degree in co-relation 5564. Up to 2141 conditions per place. [2023-08-24 13:28:16,889 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 59 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-24 13:28:16,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 309 flow [2023-08-24 13:28:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:28:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 13:28:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-24 13:28:16,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369738339021616 [2023-08-24 13:28:16,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-24 13:28:16,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-24 13:28:16,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:16,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-24 13:28:16,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-08-24 13:28:16,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:16,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:16,928 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 472 transitions. [2023-08-24 13:28:16,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 309 flow [2023-08-24 13:28:16,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 271 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 13:28:16,938 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 105 flow [2023-08-24 13:28:16,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-08-24 13:28:16,943 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-24 13:28:16,943 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 105 flow [2023-08-24 13:28:16,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-08-24 13:28:16,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:16,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:16,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 13:28:16,945 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 4 more)] === [2023-08-24 13:28:16,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1079964367, now seen corresponding path program 1 times [2023-08-24 13:28:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101485525] [2023-08-24 13:28:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:16,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 13:28:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:17,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101485525] [2023-08-24 13:28:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101485525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:28:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700973501] [2023-08-24 13:28:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:28:17,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:17,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-08-24 13:28:17,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:17,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:17,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:17,945 INFO L124 PetriNetUnfolderBase]: 4887/5960 cut-off events. [2023-08-24 13:28:17,945 INFO L125 PetriNetUnfolderBase]: For 789/789 co-relation queries the response was YES. [2023-08-24 13:28:17,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13241 conditions, 5960 events. 4887/5960 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17742 event pairs, 529 based on Foata normal form. 126/4330 useless extension candidates. Maximal degree in co-relation 7451. Up to 4746 conditions per place. [2023-08-24 13:28:17,980 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 74 selfloop transitions, 13 changer transitions 7/94 dead transitions. [2023-08-24 13:28:17,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 425 flow [2023-08-24 13:28:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-24 13:28:17,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46928327645051193 [2023-08-24 13:28:17,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-24 13:28:17,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-24 13:28:17,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:17,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-24 13:28:17,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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-08-24 13:28:17,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:17,989 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:17,990 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 105 flow. Second operand 4 states and 550 transitions. [2023-08-24 13:28:17,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 425 flow [2023-08-24 13:28:17,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:28:17,994 INFO L231 Difference]: Finished difference. Result has 45 places, 51 transitions, 191 flow [2023-08-24 13:28:17,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=51} [2023-08-24 13:28:17,995 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-24 13:28:17,995 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 191 flow [2023-08-24 13:28:17,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-08-24 13:28:17,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:17,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:17,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 13:28:17,996 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 4 more)] === [2023-08-24 13:28:17,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 978865401, now seen corresponding path program 1 times [2023-08-24 13:28:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060190951] [2023-08-24 13:28:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 13:28:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060190951] [2023-08-24 13:28:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060190951] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814262006] [2023-08-24 13:28:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:18,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:18,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:18,273 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-08-24 13:28:18,302 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-08-24 13:28:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:18,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 13:28:18,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 13:28:18,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:28:18,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814262006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:18,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:28:18,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-24 13:28:18,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56921197] [2023-08-24 13:28:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:18,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 13:28:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:18,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 13:28:18,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:28:18,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 13:28:18,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 51 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-08-24 13:28:18,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:18,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 13:28:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:19,301 INFO L124 PetriNetUnfolderBase]: 6427/7817 cut-off events. [2023-08-24 13:28:19,302 INFO L125 PetriNetUnfolderBase]: For 5153/5153 co-relation queries the response was YES. [2023-08-24 13:28:19,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21888 conditions, 7817 events. 6427/7817 cut-off events. For 5153/5153 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 23405 event pairs, 2167 based on Foata normal form. 1/7818 useless extension candidates. Maximal degree in co-relation 12123. Up to 5110 conditions per place. [2023-08-24 13:28:19,353 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 67 selfloop transitions, 13 changer transitions 5/85 dead transitions. [2023-08-24 13:28:19,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 456 flow [2023-08-24 13:28:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:28:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 13:28:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-24 13:28:19,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119453924914675 [2023-08-24 13:28:19,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-24 13:28:19,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-24 13:28:19,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:19,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-24 13:28:19,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-08-24 13:28:19,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:19,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:19,360 INFO L175 Difference]: Start difference. First operand has 45 places, 51 transitions, 191 flow. Second operand 3 states and 450 transitions. [2023-08-24 13:28:19,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 456 flow [2023-08-24 13:28:19,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 13:28:19,367 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 256 flow [2023-08-24 13:28:19,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2023-08-24 13:28:19,369 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-24 13:28:19,369 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 256 flow [2023-08-24 13:28:19,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-08-24 13:28:19,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:19,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:19,380 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-08-24 13:28:19,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:19,576 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 4 more)] === [2023-08-24 13:28:19,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1588966705, now seen corresponding path program 1 times [2023-08-24 13:28:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:19,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327962290] [2023-08-24 13:28:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 13:28:19,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327962290] [2023-08-24 13:28:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327962290] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:28:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584276555] [2023-08-24 13:28:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:19,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:28:19,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:19,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 55 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-08-24 13:28:19,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:19,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:19,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:20,550 INFO L124 PetriNetUnfolderBase]: 6271/7661 cut-off events. [2023-08-24 13:28:20,550 INFO L125 PetriNetUnfolderBase]: For 9563/9563 co-relation queries the response was YES. [2023-08-24 13:28:20,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24370 conditions, 7661 events. 6271/7661 cut-off events. For 9563/9563 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 23885 event pairs, 1083 based on Foata normal form. 156/7817 useless extension candidates. Maximal degree in co-relation 13894. Up to 6447 conditions per place. [2023-08-24 13:28:20,583 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 80 selfloop transitions, 19 changer transitions 9/108 dead transitions. [2023-08-24 13:28:20,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 644 flow [2023-08-24 13:28:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-24 13:28:20,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46928327645051193 [2023-08-24 13:28:20,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-24 13:28:20,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-24 13:28:20,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:20,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-24 13:28:20,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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-08-24 13:28:20,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:20,590 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:20,590 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 256 flow. Second operand 4 states and 550 transitions. [2023-08-24 13:28:20,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 644 flow [2023-08-24 13:28:20,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 108 transitions, 619 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-24 13:28:20,608 INFO L231 Difference]: Finished difference. Result has 51 places, 63 transitions, 336 flow [2023-08-24 13:28:20,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=51, PETRI_TRANSITIONS=63} [2023-08-24 13:28:20,609 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-24 13:28:20,609 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 63 transitions, 336 flow [2023-08-24 13:28:20,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-08-24 13:28:20,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:20,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:20,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 13:28:20,610 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 4 more)] === [2023-08-24 13:28:20,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1722538193, now seen corresponding path program 2 times [2023-08-24 13:28:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:20,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223342140] [2023-08-24 13:28:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 13:28:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223342140] [2023-08-24 13:28:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223342140] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008545708] [2023-08-24 13:28:20,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:28:20,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:20,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:20,810 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-08-24 13:28:20,818 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-08-24 13:28:20,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 13:28:20,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:28:20,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 13:28:20,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:21,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:28:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008545708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:28:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-24 13:28:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339013479] [2023-08-24 13:28:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:21,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 13:28:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:21,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 13:28:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:28:21,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 13:28:21,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 63 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:28:21,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:21,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 13:28:21,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:21,745 INFO L124 PetriNetUnfolderBase]: 9527/11599 cut-off events. [2023-08-24 13:28:21,746 INFO L125 PetriNetUnfolderBase]: For 12551/12551 co-relation queries the response was YES. [2023-08-24 13:28:21,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35496 conditions, 11599 events. 9527/11599 cut-off events. For 12551/12551 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37435 event pairs, 3399 based on Foata normal form. 1/11600 useless extension candidates. Maximal degree in co-relation 21625. Up to 6396 conditions per place. [2023-08-24 13:28:21,808 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 77 selfloop transitions, 13 changer transitions 5/95 dead transitions. [2023-08-24 13:28:21,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 631 flow [2023-08-24 13:28:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:28:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 13:28:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-24 13:28:21,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5415244596131968 [2023-08-24 13:28:21,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-24 13:28:21,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-24 13:28:21,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:21,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-24 13:28:21,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-08-24 13:28:21,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:21,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:21,814 INFO L175 Difference]: Start difference. First operand has 51 places, 63 transitions, 336 flow. Second operand 3 states and 476 transitions. [2023-08-24 13:28:21,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 631 flow [2023-08-24 13:28:21,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:28:21,837 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 372 flow [2023-08-24 13:28:21,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2023-08-24 13:28:21,838 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-24 13:28:21,838 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 372 flow [2023-08-24 13:28:21,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:28:21,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:21,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:21,849 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-08-24 13:28:22,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:22,049 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 4 more)] === [2023-08-24 13:28:22,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash 810242775, now seen corresponding path program 1 times [2023-08-24 13:28:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:22,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196164692] [2023-08-24 13:28:22,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 13:28:22,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:22,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196164692] [2023-08-24 13:28:22,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196164692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:22,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:22,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:28:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134364751] [2023-08-24 13:28:22,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:22,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:22,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:22,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:28:22,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:22,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-08-24 13:28:22,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:22,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:23,086 INFO L124 PetriNetUnfolderBase]: 9359/11431 cut-off events. [2023-08-24 13:28:23,086 INFO L125 PetriNetUnfolderBase]: For 17363/17363 co-relation queries the response was YES. [2023-08-24 13:28:23,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36837 conditions, 11431 events. 9359/11431 cut-off events. For 17363/17363 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 38572 event pairs, 1953 based on Foata normal form. 168/11599 useless extension candidates. Maximal degree in co-relation 24955. Up to 10217 conditions per place. [2023-08-24 13:28:23,160 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 84 selfloop transitions, 27 changer transitions 11/122 dead transitions. [2023-08-24 13:28:23,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 830 flow [2023-08-24 13:28:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-24 13:28:23,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46928327645051193 [2023-08-24 13:28:23,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-24 13:28:23,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-24 13:28:23,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:23,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-24 13:28:23,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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-08-24 13:28:23,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:23,167 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:23,167 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 372 flow. Second operand 4 states and 550 transitions. [2023-08-24 13:28:23,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 830 flow [2023-08-24 13:28:23,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 122 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:28:23,197 INFO L231 Difference]: Finished difference. Result has 56 places, 75 transitions, 510 flow [2023-08-24 13:28:23,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=56, PETRI_TRANSITIONS=75} [2023-08-24 13:28:23,199 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-24 13:28:23,199 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 510 flow [2023-08-24 13:28:23,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-08-24 13:28:23,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:23,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:23,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 13:28:23,200 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 4 more)] === [2023-08-24 13:28:23,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1503143731, now seen corresponding path program 2 times [2023-08-24 13:28:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910152888] [2023-08-24 13:28:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 13:28:23,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910152888] [2023-08-24 13:28:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910152888] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263555313] [2023-08-24 13:28:23,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:28:23,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:23,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:23,480 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-08-24 13:28:23,489 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-08-24 13:28:23,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 13:28:23,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:28:23,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 13:28:23,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:23,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:28:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263555313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:28:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-24 13:28:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853944044] [2023-08-24 13:28:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:23,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 13:28:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 13:28:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:28:23,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 13:28:23,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:28:23,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:23,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 13:28:23,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:24,726 INFO L124 PetriNetUnfolderBase]: 12615/15369 cut-off events. [2023-08-24 13:28:24,726 INFO L125 PetriNetUnfolderBase]: For 25373/25373 co-relation queries the response was YES. [2023-08-24 13:28:24,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51043 conditions, 15369 events. 12615/15369 cut-off events. For 25373/25373 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 51496 event pairs, 5545 based on Foata normal form. 1/15370 useless extension candidates. Maximal degree in co-relation 28427. Up to 8756 conditions per place. [2023-08-24 13:28:24,800 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 89 selfloop transitions, 13 changer transitions 9/111 dead transitions. [2023-08-24 13:28:24,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 855 flow [2023-08-24 13:28:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:28:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 13:28:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-24 13:28:24,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460750853242321 [2023-08-24 13:28:24,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-24 13:28:24,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-24 13:28:24,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:24,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-24 13:28:24,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-08-24 13:28:24,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:24,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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-08-24 13:28:24,805 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 510 flow. Second operand 3 states and 480 transitions. [2023-08-24 13:28:24,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 855 flow [2023-08-24 13:28:24,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 111 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:28:24,831 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 538 flow [2023-08-24 13:28:24,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=58, PETRI_TRANSITIONS=77} [2023-08-24 13:28:24,831 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-08-24 13:28:24,831 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 77 transitions, 538 flow [2023-08-24 13:28:24,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:28:24,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:24,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:24,841 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-08-24 13:28:25,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:25,039 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 4 more)] === [2023-08-24 13:28:25,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1650756802, now seen corresponding path program 1 times [2023-08-24 13:28:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65926110] [2023-08-24 13:28:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65926110] [2023-08-24 13:28:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65926110] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324491896] [2023-08-24 13:28:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:25,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:25,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:28:25,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 13:28:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:25,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:28:25,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:25,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:28:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324491896] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:28:25,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:28:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 13:28:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056230829] [2023-08-24 13:28:25,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:28:25,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:28:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:25,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:28:25,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:28:25,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:25,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 77 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 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-08-24 13:28:25,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:25,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:25,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:27,287 INFO L124 PetriNetUnfolderBase]: 17771/21680 cut-off events. [2023-08-24 13:28:27,288 INFO L125 PetriNetUnfolderBase]: For 38903/38903 co-relation queries the response was YES. [2023-08-24 13:28:27,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74244 conditions, 21680 events. 17771/21680 cut-off events. For 38903/38903 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 79240 event pairs, 3731 based on Foata normal form. 565/22245 useless extension candidates. Maximal degree in co-relation 48926. Up to 8936 conditions per place. [2023-08-24 13:28:27,434 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 127 selfloop transitions, 32 changer transitions 35/194 dead transitions. [2023-08-24 13:28:27,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 194 transitions, 1337 flow [2023-08-24 13:28:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:28:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:28:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions. [2023-08-24 13:28:27,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47724687144482364 [2023-08-24 13:28:27,438 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 839 transitions. [2023-08-24 13:28:27,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 839 transitions. [2023-08-24 13:28:27,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:27,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 839 transitions. [2023-08-24 13:28:27,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 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-08-24 13:28:27,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:28:27,445 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:28:27,445 INFO L175 Difference]: Start difference. First operand has 58 places, 77 transitions, 538 flow. Second operand 6 states and 839 transitions. [2023-08-24 13:28:27,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 194 transitions, 1337 flow [2023-08-24 13:28:27,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 194 transitions, 1324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:28:27,501 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 620 flow [2023-08-24 13:28:27,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=64, PETRI_TRANSITIONS=79} [2023-08-24 13:28:27,504 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-24 13:28:27,504 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 79 transitions, 620 flow [2023-08-24 13:28:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 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-08-24 13:28:27,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:27,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:27,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 13:28:27,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:27,711 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 4 more)] === [2023-08-24 13:28:27,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 201729358, now seen corresponding path program 1 times [2023-08-24 13:28:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621245671] [2023-08-24 13:28:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621245671] [2023-08-24 13:28:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621245671] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:27,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361781661] [2023-08-24 13:28:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:27,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:28:27,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 13:28:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:28,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:28:28,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:28,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:28:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:28,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361781661] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:28:28,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:28:28,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 13:28:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182153687] [2023-08-24 13:28:28,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:28:28,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:28:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:28,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:28:28,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:28:28,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:28,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 79 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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-08-24 13:28:28,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:28,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:28,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:30,220 INFO L124 PetriNetUnfolderBase]: 23171/28330 cut-off events. [2023-08-24 13:28:30,220 INFO L125 PetriNetUnfolderBase]: For 67761/67761 co-relation queries the response was YES. [2023-08-24 13:28:30,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102761 conditions, 28330 events. 23171/28330 cut-off events. For 67761/67761 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 109009 event pairs, 3613 based on Foata normal form. 757/29087 useless extension candidates. Maximal degree in co-relation 54810. Up to 10010 conditions per place. [2023-08-24 13:28:30,334 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 154 selfloop transitions, 30 changer transitions 18/202 dead transitions. [2023-08-24 13:28:30,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 202 transitions, 1602 flow [2023-08-24 13:28:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:28:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:28:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2023-08-24 13:28:30,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47042093287827075 [2023-08-24 13:28:30,337 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2023-08-24 13:28:30,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2023-08-24 13:28:30,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:30,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2023-08-24 13:28:30,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 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-08-24 13:28:30,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:28:30,342 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:28:30,342 INFO L175 Difference]: Start difference. First operand has 64 places, 79 transitions, 620 flow. Second operand 6 states and 827 transitions. [2023-08-24 13:28:30,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 202 transitions, 1602 flow [2023-08-24 13:28:30,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 202 transitions, 1538 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:30,447 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 663 flow [2023-08-24 13:28:30,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2023-08-24 13:28:30,448 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-24 13:28:30,448 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 663 flow [2023-08-24 13:28:30,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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-08-24 13:28:30,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:30,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:30,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 13:28:30,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:30,655 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 4 more)] === [2023-08-24 13:28:30,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -735069493, now seen corresponding path program 1 times [2023-08-24 13:28:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789386473] [2023-08-24 13:28:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789386473] [2023-08-24 13:28:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789386473] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445901100] [2023-08-24 13:28:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:30,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:30,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:28:30,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 13:28:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:30,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:28:31,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:31,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:28:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:31,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445901100] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:28:31,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:28:31,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 13:28:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259351330] [2023-08-24 13:28:31,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:28:31,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:28:31,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:28:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:28:31,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:31,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 663 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 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-08-24 13:28:31,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:31,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:31,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:33,804 INFO L124 PetriNetUnfolderBase]: 32931/40393 cut-off events. [2023-08-24 13:28:33,805 INFO L125 PetriNetUnfolderBase]: For 112155/112155 co-relation queries the response was YES. [2023-08-24 13:28:33,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159006 conditions, 40393 events. 32931/40393 cut-off events. For 112155/112155 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 167655 event pairs, 4945 based on Foata normal form. 1321/41714 useless extension candidates. Maximal degree in co-relation 98913. Up to 17631 conditions per place. [2023-08-24 13:28:33,984 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 153 selfloop transitions, 32 changer transitions 25/210 dead transitions. [2023-08-24 13:28:33,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 210 transitions, 1685 flow [2023-08-24 13:28:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:28:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:28:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 835 transitions. [2023-08-24 13:28:33,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474971558589306 [2023-08-24 13:28:33,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 835 transitions. [2023-08-24 13:28:33,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 835 transitions. [2023-08-24 13:28:33,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:33,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 835 transitions. [2023-08-24 13:28:33,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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-08-24 13:28:33,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:28:33,992 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:28:33,992 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 663 flow. Second operand 6 states and 835 transitions. [2023-08-24 13:28:33,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 210 transitions, 1685 flow [2023-08-24 13:28:34,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 210 transitions, 1602 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-24 13:28:34,231 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 705 flow [2023-08-24 13:28:34,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=705, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2023-08-24 13:28:34,232 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-24 13:28:34,232 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 705 flow [2023-08-24 13:28:34,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 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-08-24 13:28:34,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:34,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:34,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-24 13:28:34,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:34,434 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 4 more)] === [2023-08-24 13:28:34,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash -737156810, now seen corresponding path program 1 times [2023-08-24 13:28:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485928892] [2023-08-24 13:28:34,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485928892] [2023-08-24 13:28:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485928892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:28:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694007416] [2023-08-24 13:28:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:34,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:34,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:28:34,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:34,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 705 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-24 13:28:34,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:34,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:34,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:37,521 INFO L124 PetriNetUnfolderBase]: 37866/46390 cut-off events. [2023-08-24 13:28:37,522 INFO L125 PetriNetUnfolderBase]: For 150964/150964 co-relation queries the response was YES. [2023-08-24 13:28:37,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194579 conditions, 46390 events. 37866/46390 cut-off events. For 150964/150964 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 191228 event pairs, 12186 based on Foata normal form. 1116/47506 useless extension candidates. Maximal degree in co-relation 98049. Up to 40691 conditions per place. [2023-08-24 13:28:37,703 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 104 selfloop transitions, 26 changer transitions 12/142 dead transitions. [2023-08-24 13:28:37,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1284 flow [2023-08-24 13:28:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-24 13:28:37,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-08-24 13:28:37,705 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-24 13:28:37,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-24 13:28:37,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:37,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-24 13:28:37,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-08-24 13:28:37,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:37,709 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:37,709 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 705 flow. Second operand 4 states and 548 transitions. [2023-08-24 13:28:37,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1284 flow [2023-08-24 13:28:38,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 142 transitions, 1234 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:38,219 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 728 flow [2023-08-24 13:28:38,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=728, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2023-08-24 13:28:38,220 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2023-08-24 13:28:38,220 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 728 flow [2023-08-24 13:28:38,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-24 13:28:38,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:38,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:38,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 13:28:38,221 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 4 more)] === [2023-08-24 13:28:38,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1437927406, now seen corresponding path program 2 times [2023-08-24 13:28:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362486975] [2023-08-24 13:28:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362486975] [2023-08-24 13:28:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362486975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:38,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:38,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:28:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083452004] [2023-08-24 13:28:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:38,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:28:38,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:38,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 728 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-24 13:28:38,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:38,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:38,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:41,776 INFO L124 PetriNetUnfolderBase]: 43850/53622 cut-off events. [2023-08-24 13:28:41,776 INFO L125 PetriNetUnfolderBase]: For 171325/171325 co-relation queries the response was YES. [2023-08-24 13:28:41,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230250 conditions, 53622 events. 43850/53622 cut-off events. For 171325/171325 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 224489 event pairs, 14317 based on Foata normal form. 1248/54870 useless extension candidates. Maximal degree in co-relation 127790. Up to 47075 conditions per place. [2023-08-24 13:28:42,006 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 101 selfloop transitions, 26 changer transitions 12/139 dead transitions. [2023-08-24 13:28:42,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 139 transitions, 1255 flow [2023-08-24 13:28:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-24 13:28:42,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-08-24 13:28:42,008 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-24 13:28:42,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-24 13:28:42,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:42,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-24 13:28:42,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-08-24 13:28:42,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:42,012 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:42,012 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 728 flow. Second operand 4 states and 548 transitions. [2023-08-24 13:28:42,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 139 transitions, 1255 flow [2023-08-24 13:28:42,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 139 transitions, 1206 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:42,755 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 746 flow [2023-08-24 13:28:42,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=746, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2023-08-24 13:28:42,756 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2023-08-24 13:28:42,756 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 746 flow [2023-08-24 13:28:42,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-24 13:28:42,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:42,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:42,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 13:28:42,757 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:28:42,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1844332026, now seen corresponding path program 3 times [2023-08-24 13:28:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166044283] [2023-08-24 13:28:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:42,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166044283] [2023-08-24 13:28:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166044283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:28:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703524787] [2023-08-24 13:28:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:42,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:28:42,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:42,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 746 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-24 13:28:42,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:42,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:42,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:46,804 INFO L124 PetriNetUnfolderBase]: 47994/58602 cut-off events. [2023-08-24 13:28:46,804 INFO L125 PetriNetUnfolderBase]: For 202582/202582 co-relation queries the response was YES. [2023-08-24 13:28:46,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257703 conditions, 58602 events. 47994/58602 cut-off events. For 202582/202582 co-relation queries the response was YES. Maximal size of possible extension queue 1503. Compared 246886 event pairs, 15767 based on Foata normal form. 836/59438 useless extension candidates. Maximal degree in co-relation 157494. Up to 53907 conditions per place. [2023-08-24 13:28:47,084 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 102 selfloop transitions, 26 changer transitions 12/140 dead transitions. [2023-08-24 13:28:47,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 140 transitions, 1279 flow [2023-08-24 13:28:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-24 13:28:47,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-08-24 13:28:47,086 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-24 13:28:47,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-24 13:28:47,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:47,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-24 13:28:47,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-08-24 13:28:47,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:47,090 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:47,090 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 746 flow. Second operand 4 states and 548 transitions. [2023-08-24 13:28:47,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 140 transitions, 1279 flow [2023-08-24 13:28:47,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 140 transitions, 1230 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:47,946 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 764 flow [2023-08-24 13:28:47,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=764, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2023-08-24 13:28:47,947 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2023-08-24 13:28:47,947 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 764 flow [2023-08-24 13:28:47,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-24 13:28:47,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:47,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:47,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 13:28:47,948 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:28:47,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1860257788, now seen corresponding path program 1 times [2023-08-24 13:28:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:47,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032958283] [2023-08-24 13:28:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032958283] [2023-08-24 13:28:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032958283] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:48,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175367696] [2023-08-24 13:28:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:48,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:48,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:48,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:28:48,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 13:28:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:48,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:28:48,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:28:48,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:28:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175367696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:48,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:28:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 13:28:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442455692] [2023-08-24 13:28:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:28:48,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 13:28:48,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 764 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-08-24 13:28:48,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:48,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 13:28:48,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:51,521 INFO L124 PetriNetUnfolderBase]: 41648/50891 cut-off events. [2023-08-24 13:28:51,521 INFO L125 PetriNetUnfolderBase]: For 182917/182917 co-relation queries the response was YES. [2023-08-24 13:28:51,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227042 conditions, 50891 events. 41648/50891 cut-off events. For 182917/182917 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 217306 event pairs, 3683 based on Foata normal form. 1276/52167 useless extension candidates. Maximal degree in co-relation 189713. Up to 23987 conditions per place. [2023-08-24 13:28:51,782 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 126 selfloop transitions, 14 changer transitions 53/193 dead transitions. [2023-08-24 13:28:51,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 193 transitions, 1731 flow [2023-08-24 13:28:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 13:28:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 13:28:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2023-08-24 13:28:51,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50580204778157 [2023-08-24 13:28:51,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2023-08-24 13:28:51,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2023-08-24 13:28:51,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:51,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2023-08-24 13:28:51,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 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-08-24 13:28:51,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-08-24 13:28:51,789 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-08-24 13:28:51,789 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 764 flow. Second operand 5 states and 741 transitions. [2023-08-24 13:28:51,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 193 transitions, 1731 flow [2023-08-24 13:28:52,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 193 transitions, 1671 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:52,561 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 639 flow [2023-08-24 13:28:52,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=639, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2023-08-24 13:28:52,562 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-08-24 13:28:52,562 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 639 flow [2023-08-24 13:28:52,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-08-24 13:28:52,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:52,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:52,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 13:28:52,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:52,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:28:52,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1742927478, now seen corresponding path program 2 times [2023-08-24 13:28:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714724736] [2023-08-24 13:28:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:52,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714724736] [2023-08-24 13:28:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714724736] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683275807] [2023-08-24 13:28:52,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:28:52,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:52,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:52,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:28:52,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 13:28:53,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 13:28:53,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:28:53,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:28:53,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:28:53,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:28:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683275807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:28:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 13:28:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453996577] [2023-08-24 13:28:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:53,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:28:53,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 13:28:53,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-08-24 13:28:53,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:53,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 13:28:53,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:55,289 INFO L124 PetriNetUnfolderBase]: 28960/35192 cut-off events. [2023-08-24 13:28:55,289 INFO L125 PetriNetUnfolderBase]: For 142660/142660 co-relation queries the response was YES. [2023-08-24 13:28:55,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162237 conditions, 35192 events. 28960/35192 cut-off events. For 142660/142660 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 137323 event pairs, 2134 based on Foata normal form. 822/36014 useless extension candidates. Maximal degree in co-relation 137881. Up to 15973 conditions per place. [2023-08-24 13:28:55,460 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 131 selfloop transitions, 8 changer transitions 46/185 dead transitions. [2023-08-24 13:28:55,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 185 transitions, 1677 flow [2023-08-24 13:28:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 13:28:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 13:28:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2023-08-24 13:28:55,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030716723549488 [2023-08-24 13:28:55,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2023-08-24 13:28:55,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2023-08-24 13:28:55,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:55,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2023-08-24 13:28:55,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 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-08-24 13:28:55,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-08-24 13:28:55,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-08-24 13:28:55,467 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 639 flow. Second operand 5 states and 737 transitions. [2023-08-24 13:28:55,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 185 transitions, 1677 flow [2023-08-24 13:28:55,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 185 transitions, 1625 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:55,848 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 530 flow [2023-08-24 13:28:55,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2023-08-24 13:28:55,849 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-24 13:28:55,849 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 530 flow [2023-08-24 13:28:55,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-08-24 13:28:55,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:55,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:55,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 13:28:56,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 13:28:56,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:28:56,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash -66181106, now seen corresponding path program 3 times [2023-08-24 13:28:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799004948] [2023-08-24 13:28:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799004948] [2023-08-24 13:28:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799004948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:28:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373645075] [2023-08-24 13:28:56,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 13:28:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:28:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:28:56,237 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:28:56,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 13:28:56,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 13:28:56,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:28:56,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:28:56,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:28:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:28:56,505 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:28:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373645075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:28:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 13:28:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35387745] [2023-08-24 13:28:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:56,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:28:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:56,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:28:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:28:56,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 13:28:56,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 530 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-08-24 13:28:56,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:56,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 13:28:56,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:28:58,624 INFO L124 PetriNetUnfolderBase]: 26526/32073 cut-off events. [2023-08-24 13:28:58,624 INFO L125 PetriNetUnfolderBase]: For 127499/127499 co-relation queries the response was YES. [2023-08-24 13:28:58,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150842 conditions, 32073 events. 26526/32073 cut-off events. For 127499/127499 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 118734 event pairs, 3762 based on Foata normal form. 816/32889 useless extension candidates. Maximal degree in co-relation 129072. Up to 20247 conditions per place. [2023-08-24 13:28:59,059 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 128 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2023-08-24 13:28:59,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 137 transitions, 1233 flow [2023-08-24 13:28:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:28:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:28:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-24 13:28:59,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974402730375427 [2023-08-24 13:28:59,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-24 13:28:59,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-24 13:28:59,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:28:59,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-24 13:28:59,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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-08-24 13:28:59,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:59,066 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:28:59,066 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 530 flow. Second operand 4 states and 583 transitions. [2023-08-24 13:28:59,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 137 transitions, 1233 flow [2023-08-24 13:28:59,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 137 transitions, 1209 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 13:28:59,298 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 539 flow [2023-08-24 13:28:59,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=539, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2023-08-24 13:28:59,299 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-24 13:28:59,299 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 539 flow [2023-08-24 13:28:59,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-08-24 13:28:59,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:28:59,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:28:59,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 13:28:59,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 13:28:59,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:28:59,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:28:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1199386863, now seen corresponding path program 1 times [2023-08-24 13:28:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:28:59,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6372754] [2023-08-24 13:28:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:28:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:28:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:28:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:28:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:28:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6372754] [2023-08-24 13:28:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6372754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:28:59,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:28:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 13:28:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241738824] [2023-08-24 13:28:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:28:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:28:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:28:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:28:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:28:59,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:28:59,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 539 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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-08-24 13:28:59,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:28:59,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:28:59,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:29:02,094 INFO L124 PetriNetUnfolderBase]: 28538/34525 cut-off events. [2023-08-24 13:29:02,094 INFO L125 PetriNetUnfolderBase]: For 152390/152390 co-relation queries the response was YES. [2023-08-24 13:29:02,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168078 conditions, 34525 events. 28538/34525 cut-off events. For 152390/152390 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 132521 event pairs, 4076 based on Foata normal form. 440/34965 useless extension candidates. Maximal degree in co-relation 128356. Up to 19933 conditions per place. [2023-08-24 13:29:02,301 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 104 selfloop transitions, 8 changer transitions 27/139 dead transitions. [2023-08-24 13:29:02,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 139 transitions, 1166 flow [2023-08-24 13:29:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 13:29:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 13:29:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-24 13:29:02,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559726962457338 [2023-08-24 13:29:02,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-24 13:29:02,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-24 13:29:02,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:29:02,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-24 13:29:02,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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-08-24 13:29:02,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-08-24 13:29:02,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-08-24 13:29:02,309 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 539 flow. Second operand 5 states and 668 transitions. [2023-08-24 13:29:02,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 139 transitions, 1166 flow [2023-08-24 13:29:02,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 139 transitions, 1136 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 13:29:02,862 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 476 flow [2023-08-24 13:29:02,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2023-08-24 13:29:02,862 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 36 predicate places. [2023-08-24 13:29:02,862 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 476 flow [2023-08-24 13:29:02,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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-08-24 13:29:02,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:29:02,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:29:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 13:29:02,863 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:29:02,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:29:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1898826339, now seen corresponding path program 2 times [2023-08-24 13:29:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:29:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904751529] [2023-08-24 13:29:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:29:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:29:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:29:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 13:29:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:29:03,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904751529] [2023-08-24 13:29:03,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904751529] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:29:03,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016389029] [2023-08-24 13:29:03,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:29:03,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:29:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:29:03,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:29:03,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 13:29:03,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 13:29:03,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:29:03,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:29:03,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:29:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:29:03,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:29:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 13:29:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016389029] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:29:03,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:29:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2023-08-24 13:29:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990521027] [2023-08-24 13:29:03,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:29:03,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:29:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:29:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:29:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:29:03,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:29:03,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 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-08-24 13:29:03,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:29:03,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:29:03,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:29:06,096 INFO L124 PetriNetUnfolderBase]: 31652/38211 cut-off events. [2023-08-24 13:29:06,096 INFO L125 PetriNetUnfolderBase]: For 158224/158224 co-relation queries the response was YES. [2023-08-24 13:29:06,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181614 conditions, 38211 events. 31652/38211 cut-off events. For 158224/158224 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 149404 event pairs, 2800 based on Foata normal form. 1040/39251 useless extension candidates. Maximal degree in co-relation 155763. Up to 25583 conditions per place. [2023-08-24 13:29:06,314 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 156 selfloop transitions, 16 changer transitions 0/172 dead transitions. [2023-08-24 13:29:06,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 172 transitions, 1418 flow [2023-08-24 13:29:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:29:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:29:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-24 13:29:06,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45449374288964733 [2023-08-24 13:29:06,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-24 13:29:06,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-24 13:29:06,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:29:06,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-24 13:29:06,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 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-08-24 13:29:06,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:29:06,321 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:29:06,321 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 476 flow. Second operand 6 states and 799 transitions. [2023-08-24 13:29:06,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 172 transitions, 1418 flow [2023-08-24 13:29:06,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 172 transitions, 1399 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 13:29:06,734 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 545 flow [2023-08-24 13:29:06,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=545, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2023-08-24 13:29:06,734 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2023-08-24 13:29:06,734 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 545 flow [2023-08-24 13:29:06,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 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-08-24 13:29:06,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:29:06,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:29:06,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 13:29:06,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 13:29:06,936 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:29:06,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:29:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2075406454, now seen corresponding path program 1 times [2023-08-24 13:29:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:29:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923885929] [2023-08-24 13:29:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:29:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:29:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:29:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:29:07,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:29:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923885929] [2023-08-24 13:29:07,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923885929] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:29:07,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136362882] [2023-08-24 13:29:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:29:07,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:29:07,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:29:07,129 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:29:07,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 13:29:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:29:07,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:29:07,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:29:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:29:07,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:29:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:29:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136362882] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:29:07,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:29:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2023-08-24 13:29:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851928130] [2023-08-24 13:29:07,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:29:07,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:29:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:29:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:29:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:29:07,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 13:29:07,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 545 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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-08-24 13:29:07,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:29:07,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 13:29:07,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:29:09,724 INFO L124 PetriNetUnfolderBase]: 26332/31772 cut-off events. [2023-08-24 13:29:09,724 INFO L125 PetriNetUnfolderBase]: For 184435/184435 co-relation queries the response was YES. [2023-08-24 13:29:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161790 conditions, 31772 events. 26332/31772 cut-off events. For 184435/184435 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 120110 event pairs, 1722 based on Foata normal form. 808/32580 useless extension candidates. Maximal degree in co-relation 139667. Up to 13156 conditions per place. [2023-08-24 13:29:09,926 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 138 selfloop transitions, 12 changer transitions 47/197 dead transitions. [2023-08-24 13:29:09,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 197 transitions, 1762 flow [2023-08-24 13:29:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:29:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:29:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-24 13:29:09,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459613196814562 [2023-08-24 13:29:09,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-24 13:29:09,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-24 13:29:09,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:29:09,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-24 13:29:09,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-08-24 13:29:09,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:29:09,934 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 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-08-24 13:29:09,934 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 545 flow. Second operand 6 states and 808 transitions. [2023-08-24 13:29:09,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 197 transitions, 1762 flow [2023-08-24 13:29:10,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 197 transitions, 1685 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-08-24 13:29:10,351 INFO L231 Difference]: Finished difference. Result has 93 places, 70 transitions, 548 flow [2023-08-24 13:29:10,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=93, PETRI_TRANSITIONS=70} [2023-08-24 13:29:10,352 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-24 13:29:10,352 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 70 transitions, 548 flow [2023-08-24 13:29:10,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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-08-24 13:29:10,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:29:10,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:29:10,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 13:29:10,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:29:10,553 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:29:10,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:29:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1490440730, now seen corresponding path program 2 times [2023-08-24 13:29:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:29:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869303175] [2023-08-24 13:29:10,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:29:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:29:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:29:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:29:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:29:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869303175] [2023-08-24 13:29:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869303175] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:29:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018753570] [2023-08-24 13:29:10,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:29:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:29:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:29:10,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:29:11,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 13:29:11,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 13:29:11,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:29:11,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:29:11,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:29:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 13:29:11,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 13:29:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018753570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:29:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 13:29:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 13:29:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884986564] [2023-08-24 13:29:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:29:11,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:29:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:29:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:29:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:29:11,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 13:29:11,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 70 transitions, 548 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 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-08-24 13:29:11,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:29:11,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 13:29:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:29:13,031 INFO L124 PetriNetUnfolderBase]: 22304/26705 cut-off events. [2023-08-24 13:29:13,032 INFO L125 PetriNetUnfolderBase]: For 140725/140725 co-relation queries the response was YES. [2023-08-24 13:29:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136097 conditions, 26705 events. 22304/26705 cut-off events. For 140725/140725 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 92892 event pairs, 5480 based on Foata normal form. 592/27297 useless extension candidates. Maximal degree in co-relation 118448. Up to 19461 conditions per place. [2023-08-24 13:29:13,237 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 132 selfloop transitions, 9 changer transitions 0/141 dead transitions. [2023-08-24 13:29:13,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 1299 flow [2023-08-24 13:29:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:29:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:29:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-24 13:29:13,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974402730375427 [2023-08-24 13:29:13,239 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-24 13:29:13,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-24 13:29:13,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:29:13,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-24 13:29:13,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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-08-24 13:29:13,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:29:13,242 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-08-24 13:29:13,243 INFO L175 Difference]: Start difference. First operand has 93 places, 70 transitions, 548 flow. Second operand 4 states and 583 transitions. [2023-08-24 13:29:13,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 1299 flow [2023-08-24 13:29:13,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 1265 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 13:29:13,863 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 550 flow [2023-08-24 13:29:13,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=550, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2023-08-24 13:29:13,863 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-24 13:29:13,864 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 550 flow [2023-08-24 13:29:13,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 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-08-24 13:29:13,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:29:13,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:29:13,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 13:29:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:29:14,073 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 13:29:14,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:29:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash 460065354, now seen corresponding path program 1 times [2023-08-24 13:29:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:29:14,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258374043] [2023-08-24 13:29:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:29:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:29:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:29:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 13:29:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:29:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258374043] [2023-08-24 13:29:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258374043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:29:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569039775] [2023-08-24 13:29:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:29:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:29:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:29:14,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 13:29:14,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 13:29:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:29:23,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-24 13:29:23,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:29:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 13:29:29,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:29:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 13:29:44,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569039775] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:29:44,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:29:44,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2023-08-24 13:29:44,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365566825] [2023-08-24 13:29:44,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:29:44,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 13:29:44,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:29:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 13:29:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=94, Unknown=8, NotChecked=0, Total=132 [2023-08-24 13:29:44,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 293 [2023-08-24 13:29:44,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 71 transitions, 550 flow. Second operand has 12 states, 12 states have (on average 129.25) internal successors, (1551), 12 states have internal predecessors, (1551), 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-08-24 13:29:44,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:29:44,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 293 [2023-08-24 13:29:44,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:31:26,693 WARN L234 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 50 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:31:28,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:53,328 WARN L234 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 51 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:32:55,692 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-08-24 13:32:57,707 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-08-24 13:32:59,717 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-08-24 13:33:01,946 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-08-24 13:33:04,367 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-08-24 13:33:06,372 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-08-24 13:33:51,346 WARN L234 SmtUtils]: Spent 25.40s on a formula simplification. DAG size of input: 41 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:33:53,436 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-08-24 13:33:55,582 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-08-24 13:33:57,593 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-08-24 13:33:59,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:34:01,613 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-08-24 13:34:03,618 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-08-24 13:34:05,622 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-08-24 13:34:07,625 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-08-24 13:34:09,633 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-08-24 13:34:11,829 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-08-24 13:34:13,908 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x1~0 4294967296)) (.cse0 (mod c_~n~0 4294967296))) (let ((.cse2 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse3 (<= .cse0 (mod c_~x5~0 4294967296))) (.cse5 (< .cse1 .cse0)) (.cse7 (+ (* (div c_~x6~0 4294967296) 4294967296) c_~x5~0)) (.cse6 (+ c_~x6~0 (* (div c_~x5~0 4294967296) 4294967296)))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (< .cse2 .cse0) (= (mod (div c_~x2~0 2) 4294967296) .cse2) (let ((.cse4 (* (mod c_~x2~0 2147483648) 2))) (or .cse3 (< .cse4 .cse0) (= .cse1 .cse4) .cse5)) (= (mod c_~x1~0 2) 0) (<= .cse6 .cse7) (let ((.cse8 (mod c_~x2~0 4294967296))) (or .cse3 (= .cse1 .cse8) .cse5 (< .cse8 .cse0))) (<= .cse7 .cse6)))) is different from false [2023-08-24 13:34:15,932 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-08-24 13:34:23,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:34:25,420 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-08-24 13:34:27,432 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-08-24 13:34:29,441 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-08-24 13:34:31,671 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-08-24 13:34:33,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 13:34:36,457 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-08-24 13:34:38,462 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-08-24 13:36:14,810 WARN L234 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 39 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:36:17,817 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-08-24 13:36:19,833 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-08-24 13:36:21,839 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-08-24 13:36:25,126 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-08-24 13:36:27,157 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-08-24 13:36:29,162 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-08-24 13:36:31,808 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-08-24 13:36:33,814 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-08-24 13:36:35,825 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-08-24 13:36:37,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:36:39,466 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-08-24 13:36:41,472 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-08-24 13:36:43,483 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-08-24 13:36:44,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:36:46,865 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-08-24 13:36:48,874 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse3 (+ (* (div c_~x6~0 4294967296) 4294967296) c_~x5~0)) (.cse2 (+ c_~x6~0 (* (div c_~x5~0 4294967296) 4294967296)))) (and (= (mod c_~x2~0 2) 0) (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x1~0 4294967296)) (< .cse0 .cse1) (= (mod (div c_~x2~0 2) 4294967296) .cse0) (= (mod c_~x1~0 2) 0) (<= .cse2 .cse3) (<= .cse3 .cse2))) is different from false [2023-08-24 13:36:50,878 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-08-24 13:36:52,883 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-08-24 13:36:54,890 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-08-24 13:36:56,898 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-08-24 13:36:58,903 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-08-24 13:37:01,421 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-08-24 13:37:03,550 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-08-24 13:37:05,562 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-08-24 13:37:07,615 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-08-24 13:37:09,626 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-08-24 13:37:11,632 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-08-24 13:37:14,842 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-08-24 13:37:16,856 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-08-24 13:37:24,817 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-08-24 13:37:34,044 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-08-24 13:37:36,050 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-08-24 13:37:38,057 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-08-24 13:37:40,108 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-08-24 13:37:42,157 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-08-24 13:37:44,160 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-08-24 13:37:46,688 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-08-24 13:37:48,913 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-08-24 13:39:05,693 WARN L234 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 50 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:39:07,737 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-08-24 13:39:09,823 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-08-24 13:39:12,626 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-08-24 13:39:14,633 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-08-24 13:39:16,646 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-08-24 13:39:18,692 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-08-24 13:39:20,729 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-08-24 13:39:28,905 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-08-24 13:39:30,915 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-08-24 13:39:32,923 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-08-24 13:39:34,942 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-08-24 13:39:43,220 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-08-24 13:39:44,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:39:46,732 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-08-24 13:39:48,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:39:50,140 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-08-24 13:39:52,151 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-08-24 13:39:54,158 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-08-24 13:39:56,179 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-08-24 13:39:58,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:40:00,127 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-08-24 13:40:02,139 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-08-24 13:40:04,158 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-08-24 13:40:28,678 WARN L234 SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:41:52,521 WARN L234 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 49 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-08-24 13:42:24,671 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-08-24 13:42:24,671 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:42:25,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 13:42:25,872 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-08-24 13:42:25,878 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-08-24 13:42:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-24 13:42:25,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 13:42:25,879 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-24 13:42:25,883 INFO L158 Benchmark]: Toolchain (without parser) took 857576.42ms. Allocated memory was 392.2MB in the beginning and 14.9GB in the end (delta: 14.5GB). Free memory was 368.5MB in the beginning and 11.6GB in the end (delta: -11.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2023-08-24 13:42:25,883 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 392.2MB. Free memory was 370.1MB in the beginning and 370.1MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:42:25,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.09ms. Allocated memory is still 392.2MB. Free memory was 368.0MB in the beginning and 356.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 13:42:25,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.57ms. Allocated memory is still 392.2MB. Free memory was 356.4MB in the beginning and 354.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:42:25,884 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 392.2MB. Free memory was 354.3MB in the beginning and 352.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:42:25,884 INFO L158 Benchmark]: RCFGBuilder took 475.72ms. Allocated memory is still 392.2MB. Free memory was 352.8MB in the beginning and 335.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-24 13:42:25,884 INFO L158 Benchmark]: TraceAbstraction took 856731.19ms. Allocated memory was 392.2MB in the beginning and 14.9GB in the end (delta: 14.5GB). Free memory was 334.5MB in the beginning and 11.6GB in the end (delta: -11.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2023-08-24 13:42:25,886 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.14ms. Allocated memory is still 392.2MB. Free memory was 370.1MB in the beginning and 370.1MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 275.09ms. Allocated memory is still 392.2MB. Free memory was 368.0MB in the beginning and 356.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.57ms. Allocated memory is still 392.2MB. Free memory was 356.4MB in the beginning and 354.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 392.2MB. Free memory was 354.3MB in the beginning and 352.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 475.72ms. Allocated memory is still 392.2MB. Free memory was 352.8MB in the beginning and 335.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 856731.19ms. Allocated memory was 392.2MB in the beginning and 14.9GB in the end (delta: 14.5GB). Free memory was 334.5MB in the beginning and 11.6GB in the end (delta: -11.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 152 PlacesBefore, 50 PlacesAfterwards, 147 TransitionsBefore, 37 TransitionsAfterwards, 2916 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 12 ConcurrentYvCompositions, 8 ChoiceCompositions, 124 TotalNumberOfCompositions, 3543 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3543, independent: 3543, independent conditional: 0, independent unconditional: 3543, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1564, independent: 1564, independent conditional: 0, independent unconditional: 1564, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3543, independent: 1979, independent conditional: 0, independent unconditional: 1979, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1564, unknown conditional: 0, unknown unconditional: 1564] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown