/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 INSUFFICIENT_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 07:15:47,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 07:15:47,607 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 07:15:47,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 07:15:47,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 07:15:47,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 07:15:47,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 07:15:47,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 07:15:47,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 07:15:47,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 07:15:47,650 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 07:15:47,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 07:15:47,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 07:15:47,652 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 07:15:47,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 07:15:47,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 07:15:47,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 07:15:47,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 07:15:47,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 07:15:47,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 07:15:47,653 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 07:15:47,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 07:15:47,654 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 07:15:47,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 07:15:47,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 07:15:47,655 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 07:15:47,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 07:15:47,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 07:15:47,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 07:15:47,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 07:15:47,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 07:15:47,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 07:15:47,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 07:15:47,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 07:15:47,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 07:15:47,658 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 -> INSUFFICIENT_FIRST [2023-08-24 07:15:47,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 07:15:47,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 07:15:47,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 07:15:47,990 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 07:15:47,991 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 07:15:47,992 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 07:15:49,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 07:15:49,361 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 07:15:49,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-24 07:15:49,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a3fab5d/120ab70dd2164f00a4fa7fb71a6df7ce/FLAGa329c3f52 [2023-08-24 07:15:49,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a3fab5d/120ab70dd2164f00a4fa7fb71a6df7ce [2023-08-24 07:15:49,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 07:15:49,389 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 07:15:49,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 07:15:49,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 07:15:49,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 07:15:49,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319bc80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49, skipping insertion in model container [2023-08-24 07:15:49,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 07:15:49,590 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 07:15:49,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 07:15:49,607 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 07:15:49,648 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 07:15:49,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 07:15:49,662 INFO L206 MainTranslator]: Completed translation [2023-08-24 07:15:49,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49 WrapperNode [2023-08-24 07:15:49,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 07:15:49,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 07:15:49,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 07:15:49,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 07:15:49,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,705 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2023-08-24 07:15:49,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 07:15:49,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 07:15:49,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 07:15:49,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 07:15:49,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 07:15:49,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 07:15:49,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 07:15:49,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 07:15:49,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (1/1) ... [2023-08-24 07:15:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 07:15:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:15:49,776 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 07:15:49,789 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 07:15:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 07:15:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 07:15:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 07:15:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 07:15:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 07:15:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 07:15:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 07:15:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 07:15:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 07:15:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 07:15:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 07:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 07:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 07:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 07:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 07:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 07:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 07:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 07:15:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 07:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 07:15:49,812 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 07:15:49,908 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 07:15:49,909 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 07:15:50,189 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 07:15:50,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 07:15:50,201 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-24 07:15:50,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 07:15:50 BoogieIcfgContainer [2023-08-24 07:15:50,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 07:15:50,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 07:15:50,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 07:15:50,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 07:15:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 07:15:49" (1/3) ... [2023-08-24 07:15:50,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c27e3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 07:15:50, skipping insertion in model container [2023-08-24 07:15:50,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:15:49" (2/3) ... [2023-08-24 07:15:50,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c27e3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 07:15:50, skipping insertion in model container [2023-08-24 07:15:50,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 07:15:50" (3/3) ... [2023-08-24 07:15:50,212 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-08-24 07:15:50,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 07:15:50,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 07:15:50,229 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 07:15:50,344 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-24 07:15:50,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2023-08-24 07:15:50,463 INFO L124 PetriNetUnfolderBase]: 14/163 cut-off events. [2023-08-24 07:15:50,463 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 07:15:50,469 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 07:15:50,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2023-08-24 07:15:50,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 147 transitions, 330 flow [2023-08-24 07:15:50,480 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 07:15:50,491 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 147 transitions, 330 flow [2023-08-24 07:15:50,495 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 147 transitions, 330 flow [2023-08-24 07:15:50,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 147 transitions, 330 flow [2023-08-24 07:15:50,552 INFO L124 PetriNetUnfolderBase]: 14/147 cut-off events. [2023-08-24 07:15:50,553 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 07:15:50,555 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 07:15:50,557 INFO L119 LiptonReduction]: Number of co-enabled transitions 2916 [2023-08-24 07:15:56,230 INFO L134 LiptonReduction]: Checked pairs total: 3543 [2023-08-24 07:15:56,230 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-24 07:15:56,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 07:15:56,246 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;@76e1dad8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 07:15:56,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 07:15:56,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 07:15:56,254 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-08-24 07:15:56,254 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 07:15:56,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:15:56,255 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 07:15:56,255 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 07:15:56,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:15:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 859190718, now seen corresponding path program 1 times [2023-08-24 07:15:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:15:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410437929] [2023-08-24 07:15:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:15:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:15:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:15:57,052 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 07:15:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:15:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410437929] [2023-08-24 07:15:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410437929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:15:57,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:15:57,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 07:15:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724450800] [2023-08-24 07:15:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:15:57,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 07:15:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:15:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 07:15:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 07:15:57,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 07:15:57,087 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 07:15:57,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:15:57,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 07:15:57,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:15:57,412 INFO L124 PetriNetUnfolderBase]: 3277/3973 cut-off events. [2023-08-24 07:15:57,412 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2023-08-24 07:15:57,420 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 07:15:57,438 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 59 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-24 07:15:57,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 309 flow [2023-08-24 07:15:57,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 07:15:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 07:15:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-24 07:15:57,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369738339021616 [2023-08-24 07:15:57,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-24 07:15:57,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-24 07:15:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:15:57,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-24 07:15:57,459 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 07:15:57,463 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 07:15:57,464 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 07:15:57,465 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 472 transitions. [2023-08-24 07:15:57,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 309 flow [2023-08-24 07:15:57,471 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 07:15:57,473 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 105 flow [2023-08-24 07:15:57,474 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 07:15:57,476 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-24 07:15:57,477 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 105 flow [2023-08-24 07:15:57,477 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 07:15:57,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:15:57,477 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 07:15:57,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 07:15:57,478 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 07:15:57,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:15:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1079964367, now seen corresponding path program 1 times [2023-08-24 07:15:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:15:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048563706] [2023-08-24 07:15:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:15:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:15:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:15:57,783 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 07:15:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:15:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048563706] [2023-08-24 07:15:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048563706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:15:57,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:15:57,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:15:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79875141] [2023-08-24 07:15:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:15:57,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:15:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:15:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:15:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:15:57,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:15:57,790 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 07:15:57,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:15:57,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:15:57,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:15:58,285 INFO L124 PetriNetUnfolderBase]: 4887/5960 cut-off events. [2023-08-24 07:15:58,285 INFO L125 PetriNetUnfolderBase]: For 789/789 co-relation queries the response was YES. [2023-08-24 07:15:58,292 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 07:15:58,316 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 74 selfloop transitions, 13 changer transitions 7/94 dead transitions. [2023-08-24 07:15:58,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 425 flow [2023-08-24 07:15:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:15:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:15:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-24 07:15:58,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46928327645051193 [2023-08-24 07:15:58,320 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-24 07:15:58,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-24 07:15:58,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:15:58,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-24 07:15:58,322 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 07:15:58,324 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 07:15:58,325 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 07:15:58,325 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 105 flow. Second operand 4 states and 550 transitions. [2023-08-24 07:15:58,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 425 flow [2023-08-24 07:15:58,327 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 07:15:58,329 INFO L231 Difference]: Finished difference. Result has 45 places, 51 transitions, 191 flow [2023-08-24 07:15:58,329 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 07:15:58,329 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-24 07:15:58,330 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 191 flow [2023-08-24 07:15:58,330 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 07:15:58,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:15:58,330 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 07:15:58,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 07:15:58,331 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 07:15:58,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:15:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 978865401, now seen corresponding path program 1 times [2023-08-24 07:15:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:15:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002954078] [2023-08-24 07:15:58,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:15:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:15:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:15:58,575 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 07:15:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:15:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002954078] [2023-08-24 07:15:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002954078] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:15:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910661704] [2023-08-24 07:15:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:15:58,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:15:58,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:15:58,583 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 07:15:58,603 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 07:15:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:15:58,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 07:15:58,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:15:58,977 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 07:15:58,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:15:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910661704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:15:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:15:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-24 07:15:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016689268] [2023-08-24 07:15:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:15:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 07:15:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:15:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 07:15:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 07:15:58,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 07:15:58,981 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 07:15:58,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:15:58,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 07:15:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:15:59,470 INFO L124 PetriNetUnfolderBase]: 6427/7817 cut-off events. [2023-08-24 07:15:59,470 INFO L125 PetriNetUnfolderBase]: For 5153/5153 co-relation queries the response was YES. [2023-08-24 07:15:59,483 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 07:15:59,578 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 67 selfloop transitions, 13 changer transitions 5/85 dead transitions. [2023-08-24 07:15:59,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 456 flow [2023-08-24 07:15:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 07:15:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 07:15:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-24 07:15:59,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119453924914675 [2023-08-24 07:15:59,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-24 07:15:59,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-24 07:15:59,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:15:59,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-24 07:15:59,582 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 07:15:59,584 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 07:15:59,584 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 07:15:59,584 INFO L175 Difference]: Start difference. First operand has 45 places, 51 transitions, 191 flow. Second operand 3 states and 450 transitions. [2023-08-24 07:15:59,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 456 flow [2023-08-24 07:15:59,587 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 07:15:59,589 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 256 flow [2023-08-24 07:15:59,589 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 07:15:59,590 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-24 07:15:59,590 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 256 flow [2023-08-24 07:15:59,590 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 07:15:59,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:15:59,590 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 07:15:59,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 07:15:59,797 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 07:15:59,797 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 07:15:59,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:15:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1588966705, now seen corresponding path program 1 times [2023-08-24 07:15:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:15:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238556285] [2023-08-24 07:15:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:15:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:15:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:00,020 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 07:16:00,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:00,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238556285] [2023-08-24 07:16:00,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238556285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:00,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:16:00,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:16:00,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871444695] [2023-08-24 07:16:00,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:00,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:00,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:00,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:00,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:16:00,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:00,023 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 07:16:00,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:00,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:00,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:00,657 INFO L124 PetriNetUnfolderBase]: 6271/7661 cut-off events. [2023-08-24 07:16:00,658 INFO L125 PetriNetUnfolderBase]: For 9563/9563 co-relation queries the response was YES. [2023-08-24 07:16:00,666 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 07:16:00,697 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 80 selfloop transitions, 19 changer transitions 9/108 dead transitions. [2023-08-24 07:16:00,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 644 flow [2023-08-24 07:16:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-24 07:16:00,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46928327645051193 [2023-08-24 07:16:00,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-24 07:16:00,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-24 07:16:00,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:00,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-24 07:16:00,702 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 07:16:00,704 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 07:16:00,705 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 07:16:00,705 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 256 flow. Second operand 4 states and 550 transitions. [2023-08-24 07:16:00,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 644 flow [2023-08-24 07:16:00,721 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 07:16:00,724 INFO L231 Difference]: Finished difference. Result has 51 places, 63 transitions, 336 flow [2023-08-24 07:16:00,724 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 07:16:00,725 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-24 07:16:00,725 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 63 transitions, 336 flow [2023-08-24 07:16:00,726 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 07:16:00,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:00,726 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 07:16:00,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 07:16:00,727 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 07:16:00,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1722538193, now seen corresponding path program 2 times [2023-08-24 07:16:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570626406] [2023-08-24 07:16:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:01,038 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 07:16:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570626406] [2023-08-24 07:16:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570626406] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983796326] [2023-08-24 07:16:01,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:16:01,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:01,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:01,040 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 07:16:01,043 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 07:16:01,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 07:16:01,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:16:01,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 07:16:01,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:01,230 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 07:16:01,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:16:01,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983796326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:01,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:16:01,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-24 07:16:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313254050] [2023-08-24 07:16:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:01,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 07:16:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 07:16:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 07:16:01,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 07:16:01,233 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 07:16:01,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:01,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 07:16:01,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:01,942 INFO L124 PetriNetUnfolderBase]: 9527/11599 cut-off events. [2023-08-24 07:16:01,942 INFO L125 PetriNetUnfolderBase]: For 12551/12551 co-relation queries the response was YES. [2023-08-24 07:16:01,967 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 07:16:02,005 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 77 selfloop transitions, 13 changer transitions 5/95 dead transitions. [2023-08-24 07:16:02,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 631 flow [2023-08-24 07:16:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 07:16:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 07:16:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-24 07:16:02,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5415244596131968 [2023-08-24 07:16:02,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-24 07:16:02,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-24 07:16:02,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:02,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-24 07:16:02,008 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 07:16:02,010 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 07:16:02,011 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 07:16:02,011 INFO L175 Difference]: Start difference. First operand has 51 places, 63 transitions, 336 flow. Second operand 3 states and 476 transitions. [2023-08-24 07:16:02,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 631 flow [2023-08-24 07:16:02,035 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 07:16:02,036 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 372 flow [2023-08-24 07:16:02,036 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 07:16:02,037 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-24 07:16:02,037 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 372 flow [2023-08-24 07:16:02,038 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 07:16:02,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:02,038 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 07:16:02,046 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 07:16:02,243 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 07:16:02,244 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 07:16:02,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 810242775, now seen corresponding path program 1 times [2023-08-24 07:16:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615160398] [2023-08-24 07:16:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:02,484 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 07:16:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615160398] [2023-08-24 07:16:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615160398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:16:02,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:16:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304772057] [2023-08-24 07:16:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:02,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:02,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:16:02,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:02,488 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 07:16:02,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:02,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:02,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:03,315 INFO L124 PetriNetUnfolderBase]: 9359/11431 cut-off events. [2023-08-24 07:16:03,316 INFO L125 PetriNetUnfolderBase]: For 17363/17363 co-relation queries the response was YES. [2023-08-24 07:16:03,331 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 07:16:03,361 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 84 selfloop transitions, 27 changer transitions 11/122 dead transitions. [2023-08-24 07:16:03,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 830 flow [2023-08-24 07:16:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-24 07:16:03,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46928327645051193 [2023-08-24 07:16:03,363 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-24 07:16:03,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-24 07:16:03,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:03,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-24 07:16:03,365 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 07:16:03,367 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 07:16:03,367 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 07:16:03,367 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 372 flow. Second operand 4 states and 550 transitions. [2023-08-24 07:16:03,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 830 flow [2023-08-24 07:16:03,388 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 07:16:03,390 INFO L231 Difference]: Finished difference. Result has 56 places, 75 transitions, 510 flow [2023-08-24 07:16:03,390 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 07:16:03,391 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-24 07:16:03,391 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 510 flow [2023-08-24 07:16:03,391 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 07:16:03,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:03,392 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 07:16:03,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 07:16:03,392 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 07:16:03,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1503143731, now seen corresponding path program 2 times [2023-08-24 07:16:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304946249] [2023-08-24 07:16:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:03,585 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 07:16:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304946249] [2023-08-24 07:16:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304946249] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248623222] [2023-08-24 07:16:03,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:16:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:03,587 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 07:16:03,632 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 07:16:03,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 07:16:03,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:16:03,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 07:16:03,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:03,803 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 07:16:03,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:16:03,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248623222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:03,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:16:03,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2023-08-24 07:16:03,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514660683] [2023-08-24 07:16:03,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:03,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 07:16:03,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:03,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 07:16:03,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 07:16:03,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 07:16:03,806 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 07:16:03,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:03,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 07:16:03,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:04,594 INFO L124 PetriNetUnfolderBase]: 12615/15369 cut-off events. [2023-08-24 07:16:04,594 INFO L125 PetriNetUnfolderBase]: For 25373/25373 co-relation queries the response was YES. [2023-08-24 07:16:04,622 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 07:16:04,662 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 89 selfloop transitions, 13 changer transitions 9/111 dead transitions. [2023-08-24 07:16:04,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 855 flow [2023-08-24 07:16:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 07:16:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 07:16:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-24 07:16:04,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460750853242321 [2023-08-24 07:16:04,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-24 07:16:04,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-24 07:16:04,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:04,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-24 07:16:04,666 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 07:16:04,667 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 07:16:04,667 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 07:16:04,667 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 510 flow. Second operand 3 states and 480 transitions. [2023-08-24 07:16:04,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 855 flow [2023-08-24 07:16:04,691 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 07:16:04,692 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 538 flow [2023-08-24 07:16:04,692 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 07:16:04,693 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-08-24 07:16:04,693 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 77 transitions, 538 flow [2023-08-24 07:16:04,693 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 07:16:04,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:04,693 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 07:16:04,706 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 07:16:04,898 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 07:16:04,899 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 07:16:04,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1650756802, now seen corresponding path program 1 times [2023-08-24 07:16:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131270633] [2023-08-24 07:16:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:05,087 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 07:16:05,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:05,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131270633] [2023-08-24 07:16:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131270633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:05,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723742123] [2023-08-24 07:16:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:05,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:05,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:05,089 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 07:16:05,139 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 07:16:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:05,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:05,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:05,302 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 07:16:05,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:16:05,366 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 07:16:05,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723742123] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:16:05,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:16:05,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:16:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132712131] [2023-08-24 07:16:05,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:16:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:16:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:16:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:05,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:05,370 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 07:16:05,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:05,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:05,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:06,650 INFO L124 PetriNetUnfolderBase]: 17771/21680 cut-off events. [2023-08-24 07:16:06,650 INFO L125 PetriNetUnfolderBase]: For 38903/38903 co-relation queries the response was YES. [2023-08-24 07:16:06,686 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 07:16:06,732 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 127 selfloop transitions, 32 changer transitions 35/194 dead transitions. [2023-08-24 07:16:06,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 194 transitions, 1337 flow [2023-08-24 07:16:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 07:16:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 07:16:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions. [2023-08-24 07:16:06,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47724687144482364 [2023-08-24 07:16:06,735 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 839 transitions. [2023-08-24 07:16:06,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 839 transitions. [2023-08-24 07:16:06,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:06,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 839 transitions. [2023-08-24 07:16:06,737 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 07:16:06,740 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 07:16:06,740 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 07:16:06,740 INFO L175 Difference]: Start difference. First operand has 58 places, 77 transitions, 538 flow. Second operand 6 states and 839 transitions. [2023-08-24 07:16:06,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 194 transitions, 1337 flow [2023-08-24 07:16:06,786 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 07:16:06,788 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 620 flow [2023-08-24 07:16:06,788 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 07:16:06,789 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-24 07:16:06,789 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 79 transitions, 620 flow [2023-08-24 07:16:06,789 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 07:16:06,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:06,789 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 07:16:06,795 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 07:16:06,995 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 07:16:06,995 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 07:16:06,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash 201729358, now seen corresponding path program 1 times [2023-08-24 07:16:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446965633] [2023-08-24 07:16:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:07,184 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 07:16:07,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:07,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446965633] [2023-08-24 07:16:07,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446965633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370978302] [2023-08-24 07:16:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:07,186 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 07:16:07,189 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 07:16:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:07,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:07,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:07,380 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 07:16:07,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:16:07,454 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 07:16:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370978302] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:16:07,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:16:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:16:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11073038] [2023-08-24 07:16:07,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:16:07,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:16:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:16:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:07,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:07,457 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 07:16:07,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:07,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:07,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:09,319 INFO L124 PetriNetUnfolderBase]: 23171/28330 cut-off events. [2023-08-24 07:16:09,319 INFO L125 PetriNetUnfolderBase]: For 67761/67761 co-relation queries the response was YES. [2023-08-24 07:16:09,371 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 07:16:09,430 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 154 selfloop transitions, 30 changer transitions 18/202 dead transitions. [2023-08-24 07:16:09,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 202 transitions, 1602 flow [2023-08-24 07:16:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 07:16:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 07:16:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2023-08-24 07:16:09,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47042093287827075 [2023-08-24 07:16:09,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2023-08-24 07:16:09,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2023-08-24 07:16:09,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:09,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2023-08-24 07:16:09,436 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 07:16:09,439 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 07:16:09,440 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 07:16:09,440 INFO L175 Difference]: Start difference. First operand has 64 places, 79 transitions, 620 flow. Second operand 6 states and 827 transitions. [2023-08-24 07:16:09,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 202 transitions, 1602 flow [2023-08-24 07:16:09,523 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 07:16:09,525 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 663 flow [2023-08-24 07:16:09,525 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 07:16:09,526 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-24 07:16:09,526 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 663 flow [2023-08-24 07:16:09,526 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 07:16:09,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:09,526 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 07:16:09,532 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 07:16:09,732 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 07:16:09,732 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 07:16:09,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash -735069493, now seen corresponding path program 1 times [2023-08-24 07:16:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:09,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427905590] [2023-08-24 07:16:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:09,981 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 07:16:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:09,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427905590] [2023-08-24 07:16:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427905590] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:09,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765159923] [2023-08-24 07:16:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:09,984 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 07:16:09,993 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 07:16:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:10,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:10,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:10,196 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 07:16:10,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:16:10,260 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 07:16:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765159923] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:16:10,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:16:10,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:16:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472944740] [2023-08-24 07:16:10,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:16:10,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:16:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:16:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:10,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:10,263 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 07:16:10,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:10,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:10,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:12,703 INFO L124 PetriNetUnfolderBase]: 32931/40393 cut-off events. [2023-08-24 07:16:12,704 INFO L125 PetriNetUnfolderBase]: For 112155/112155 co-relation queries the response was YES. [2023-08-24 07:16:12,793 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 07:16:13,010 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 153 selfloop transitions, 32 changer transitions 25/210 dead transitions. [2023-08-24 07:16:13,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 210 transitions, 1685 flow [2023-08-24 07:16:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 07:16:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 07:16:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 835 transitions. [2023-08-24 07:16:13,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474971558589306 [2023-08-24 07:16:13,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 835 transitions. [2023-08-24 07:16:13,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 835 transitions. [2023-08-24 07:16:13,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:13,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 835 transitions. [2023-08-24 07:16:13,016 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 07:16:13,020 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 07:16:13,021 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 07:16:13,021 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 663 flow. Second operand 6 states and 835 transitions. [2023-08-24 07:16:13,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 210 transitions, 1685 flow [2023-08-24 07:16:13,215 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 07:16:13,217 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 705 flow [2023-08-24 07:16:13,218 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 07:16:13,218 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-24 07:16:13,218 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 705 flow [2023-08-24 07:16:13,219 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 07:16:13,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:13,219 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 07:16:13,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 07:16:13,423 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 07:16:13,424 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 07:16:13,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash -737156810, now seen corresponding path program 1 times [2023-08-24 07:16:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420496012] [2023-08-24 07:16:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:13,621 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 07:16:13,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:13,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420496012] [2023-08-24 07:16:13,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420496012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:13,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:16:13,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:16:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535365031] [2023-08-24 07:16:13,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:13,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:13,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:16:13,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:13,623 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 07:16:13,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:13,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:13,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:16,433 INFO L124 PetriNetUnfolderBase]: 37866/46390 cut-off events. [2023-08-24 07:16:16,433 INFO L125 PetriNetUnfolderBase]: For 150964/150964 co-relation queries the response was YES. [2023-08-24 07:16:16,528 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 07:16:16,594 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 104 selfloop transitions, 26 changer transitions 12/142 dead transitions. [2023-08-24 07:16:16,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1284 flow [2023-08-24 07:16:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-24 07:16:16,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-08-24 07:16:16,596 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-24 07:16:16,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-24 07:16:16,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:16,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-24 07:16:16,598 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 07:16:16,600 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 07:16:16,600 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 07:16:16,600 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 705 flow. Second operand 4 states and 548 transitions. [2023-08-24 07:16:16,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1284 flow [2023-08-24 07:16:17,007 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 07:16:17,009 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 728 flow [2023-08-24 07:16:17,009 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 07:16:17,010 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2023-08-24 07:16:17,010 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 728 flow [2023-08-24 07:16:17,010 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 07:16:17,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:17,010 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 07:16:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 07:16:17,010 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 07:16:17,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1437927406, now seen corresponding path program 2 times [2023-08-24 07:16:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910164088] [2023-08-24 07:16:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:17,191 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 07:16:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910164088] [2023-08-24 07:16:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910164088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:17,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:16:17,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:16:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767648872] [2023-08-24 07:16:17,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:17,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:16:17,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:17,196 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 07:16:17,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:17,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:17,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:20,689 INFO L124 PetriNetUnfolderBase]: 43850/53622 cut-off events. [2023-08-24 07:16:20,689 INFO L125 PetriNetUnfolderBase]: For 171325/171325 co-relation queries the response was YES. [2023-08-24 07:16:20,821 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 07:16:20,915 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 101 selfloop transitions, 26 changer transitions 12/139 dead transitions. [2023-08-24 07:16:20,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 139 transitions, 1255 flow [2023-08-24 07:16:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-24 07:16:20,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-08-24 07:16:20,917 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-24 07:16:20,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-24 07:16:20,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:20,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-24 07:16:20,919 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 07:16:20,920 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 07:16:20,921 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 07:16:20,921 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 728 flow. Second operand 4 states and 548 transitions. [2023-08-24 07:16:20,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 139 transitions, 1255 flow [2023-08-24 07:16:21,533 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 07:16:21,535 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 746 flow [2023-08-24 07:16:21,535 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 07:16:21,535 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2023-08-24 07:16:21,535 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 746 flow [2023-08-24 07:16:21,536 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 07:16:21,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:21,536 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 07:16:21,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 07:16:21,536 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 07:16:21,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1844332026, now seen corresponding path program 3 times [2023-08-24 07:16:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957574523] [2023-08-24 07:16:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:21,848 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 07:16:21,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957574523] [2023-08-24 07:16:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957574523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:21,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:16:21,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:16:21,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721515178] [2023-08-24 07:16:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:21,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:21,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:21,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:16:21,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:21,855 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 07:16:21,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:21,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:21,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:25,435 INFO L124 PetriNetUnfolderBase]: 47994/58602 cut-off events. [2023-08-24 07:16:25,435 INFO L125 PetriNetUnfolderBase]: For 202582/202582 co-relation queries the response was YES. [2023-08-24 07:16:25,587 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 07:16:25,684 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 102 selfloop transitions, 26 changer transitions 12/140 dead transitions. [2023-08-24 07:16:25,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 140 transitions, 1279 flow [2023-08-24 07:16:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-24 07:16:25,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46757679180887374 [2023-08-24 07:16:25,690 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-24 07:16:25,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-24 07:16:25,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:25,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-24 07:16:25,692 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 07:16:25,694 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 07:16:25,694 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 07:16:25,694 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 746 flow. Second operand 4 states and 548 transitions. [2023-08-24 07:16:25,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 140 transitions, 1279 flow [2023-08-24 07:16:26,534 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 07:16:26,535 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 764 flow [2023-08-24 07:16:26,536 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 07:16:26,536 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2023-08-24 07:16:26,536 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 764 flow [2023-08-24 07:16:26,536 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 07:16:26,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:26,537 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 07:16:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 07:16:26,537 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 07:16:26,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1860257788, now seen corresponding path program 1 times [2023-08-24 07:16:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:26,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535886139] [2023-08-24 07:16:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:26,699 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 07:16:26,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535886139] [2023-08-24 07:16:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535886139] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071335398] [2023-08-24 07:16:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:26,701 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 07:16:26,730 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 07:16:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:26,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:26,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:26,914 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 07:16:26,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:16:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071335398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:16:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 07:16:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045131001] [2023-08-24 07:16:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:26,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:26,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 07:16:26,916 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 07:16:26,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:26,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 07:16:26,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:29,943 INFO L124 PetriNetUnfolderBase]: 41648/50891 cut-off events. [2023-08-24 07:16:29,943 INFO L125 PetriNetUnfolderBase]: For 182917/182917 co-relation queries the response was YES. [2023-08-24 07:16:30,091 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 07:16:30,409 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 126 selfloop transitions, 14 changer transitions 53/193 dead transitions. [2023-08-24 07:16:30,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 193 transitions, 1731 flow [2023-08-24 07:16:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:16:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:16:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2023-08-24 07:16:30,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50580204778157 [2023-08-24 07:16:30,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2023-08-24 07:16:30,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2023-08-24 07:16:30,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:30,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2023-08-24 07:16:30,413 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 07:16:30,415 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 07:16:30,415 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 07:16:30,415 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 764 flow. Second operand 5 states and 741 transitions. [2023-08-24 07:16:30,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 193 transitions, 1731 flow [2023-08-24 07:16:30,930 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 07:16:30,931 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 639 flow [2023-08-24 07:16:30,932 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 07:16:30,932 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-08-24 07:16:30,932 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 639 flow [2023-08-24 07:16:30,932 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 07:16:30,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:30,932 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 07:16:30,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-24 07:16:31,137 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 07:16:31,137 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 07:16:31,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1742927478, now seen corresponding path program 2 times [2023-08-24 07:16:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392677328] [2023-08-24 07:16:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:31,308 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 07:16:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392677328] [2023-08-24 07:16:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392677328] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480323123] [2023-08-24 07:16:31,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:16:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:31,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:31,310 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 07:16:31,334 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 07:16:31,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 07:16:31,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:16:31,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:31,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:31,534 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 07:16:31,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:16:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480323123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:31,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:16:31,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 07:16:31,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022239155] [2023-08-24 07:16:31,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:31,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:31,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 07:16:31,536 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 07:16:31,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:31,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 07:16:31,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:33,740 INFO L124 PetriNetUnfolderBase]: 28960/35192 cut-off events. [2023-08-24 07:16:33,740 INFO L125 PetriNetUnfolderBase]: For 142660/142660 co-relation queries the response was YES. [2023-08-24 07:16:33,851 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 07:16:33,933 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 131 selfloop transitions, 8 changer transitions 46/185 dead transitions. [2023-08-24 07:16:33,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 185 transitions, 1677 flow [2023-08-24 07:16:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:16:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:16:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2023-08-24 07:16:33,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030716723549488 [2023-08-24 07:16:33,935 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2023-08-24 07:16:33,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2023-08-24 07:16:33,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:33,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2023-08-24 07:16:33,937 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 07:16:33,939 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 07:16:33,940 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 07:16:33,940 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 639 flow. Second operand 5 states and 737 transitions. [2023-08-24 07:16:33,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 185 transitions, 1677 flow [2023-08-24 07:16:34,575 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 07:16:34,576 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 530 flow [2023-08-24 07:16:34,577 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 07:16:34,577 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-24 07:16:34,577 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 530 flow [2023-08-24 07:16:34,577 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 07:16:34,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:34,577 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 07:16:34,584 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 07:16:34,778 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 07:16:34,778 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 07:16:34,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -66181106, now seen corresponding path program 3 times [2023-08-24 07:16:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625724975] [2023-08-24 07:16:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:34,965 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 07:16:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625724975] [2023-08-24 07:16:34,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625724975] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992696763] [2023-08-24 07:16:34,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 07:16:34,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:34,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:34,967 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 07:16:34,992 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 07:16:35,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 07:16:35,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:16:35,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:35,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:35,232 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 07:16:35,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:16:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992696763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:35,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:16:35,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 07:16:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050498873] [2023-08-24 07:16:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:35,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:35,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:35,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:35,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 07:16:35,235 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 07:16:35,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:35,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 07:16:35,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:37,180 INFO L124 PetriNetUnfolderBase]: 26526/32073 cut-off events. [2023-08-24 07:16:37,181 INFO L125 PetriNetUnfolderBase]: For 127499/127499 co-relation queries the response was YES. [2023-08-24 07:16:37,264 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 07:16:37,337 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 128 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2023-08-24 07:16:37,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 137 transitions, 1233 flow [2023-08-24 07:16:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-24 07:16:37,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974402730375427 [2023-08-24 07:16:37,339 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-24 07:16:37,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-24 07:16:37,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:37,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-24 07:16:37,341 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 07:16:37,342 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 07:16:37,343 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 07:16:37,343 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 530 flow. Second operand 4 states and 583 transitions. [2023-08-24 07:16:37,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 137 transitions, 1233 flow [2023-08-24 07:16:37,612 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 07:16:37,614 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 539 flow [2023-08-24 07:16:37,614 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 07:16:37,614 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-24 07:16:37,614 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 539 flow [2023-08-24 07:16:37,615 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 07:16:37,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:37,615 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 07:16:37,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 07:16:37,824 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 07:16:37,825 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 07:16:37,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1199386863, now seen corresponding path program 1 times [2023-08-24 07:16:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543678532] [2023-08-24 07:16:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:38,063 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 07:16:38,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:38,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543678532] [2023-08-24 07:16:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543678532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:38,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:16:38,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 07:16:38,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719802623] [2023-08-24 07:16:38,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:38,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 07:16:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 07:16:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 07:16:38,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:38,066 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 07:16:38,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:38,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:38,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:40,384 INFO L124 PetriNetUnfolderBase]: 28538/34525 cut-off events. [2023-08-24 07:16:40,384 INFO L125 PetriNetUnfolderBase]: For 152390/152390 co-relation queries the response was YES. [2023-08-24 07:16:40,493 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 07:16:40,576 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 104 selfloop transitions, 8 changer transitions 27/139 dead transitions. [2023-08-24 07:16:40,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 139 transitions, 1166 flow [2023-08-24 07:16:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:16:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:16:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-24 07:16:40,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559726962457338 [2023-08-24 07:16:40,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-24 07:16:40,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-24 07:16:40,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:40,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-24 07:16:40,580 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 07:16:40,582 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 07:16:40,582 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 07:16:40,582 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 539 flow. Second operand 5 states and 668 transitions. [2023-08-24 07:16:40,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 139 transitions, 1166 flow [2023-08-24 07:16:41,299 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 07:16:41,300 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 476 flow [2023-08-24 07:16:41,300 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 07:16:41,300 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 36 predicate places. [2023-08-24 07:16:41,300 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 476 flow [2023-08-24 07:16:41,301 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 07:16:41,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:41,301 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 07:16:41,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 07:16:41,301 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 07:16:41,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1898826339, now seen corresponding path program 2 times [2023-08-24 07:16:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:41,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598524602] [2023-08-24 07:16:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:41,464 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 07:16:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598524602] [2023-08-24 07:16:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598524602] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511986415] [2023-08-24 07:16:41,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:16:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:41,469 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 07:16:41,480 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 07:16:41,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 07:16:41,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:16:41,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:41,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:41,758 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 07:16:41,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:16:41,820 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 07:16:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511986415] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:16:41,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:16:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2023-08-24 07:16:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803137794] [2023-08-24 07:16:41,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:16:41,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:16:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:16:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:41,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:41,823 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 07:16:41,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:41,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:41,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:44,301 INFO L124 PetriNetUnfolderBase]: 31652/38211 cut-off events. [2023-08-24 07:16:44,302 INFO L125 PetriNetUnfolderBase]: For 158224/158224 co-relation queries the response was YES. [2023-08-24 07:16:44,425 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 07:16:44,518 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 156 selfloop transitions, 16 changer transitions 0/172 dead transitions. [2023-08-24 07:16:44,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 172 transitions, 1418 flow [2023-08-24 07:16:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 07:16:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 07:16:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-24 07:16:44,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45449374288964733 [2023-08-24 07:16:44,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-24 07:16:44,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-24 07:16:44,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:44,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-24 07:16:44,521 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 07:16:44,523 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 07:16:44,524 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 07:16:44,524 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 476 flow. Second operand 6 states and 799 transitions. [2023-08-24 07:16:44,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 172 transitions, 1418 flow [2023-08-24 07:16:45,172 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 07:16:45,173 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 545 flow [2023-08-24 07:16:45,173 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 07:16:45,173 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2023-08-24 07:16:45,174 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 545 flow [2023-08-24 07:16:45,174 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 07:16:45,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:45,174 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 07:16:45,179 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 07:16:45,377 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 07:16:45,377 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 07:16:45,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2075406454, now seen corresponding path program 1 times [2023-08-24 07:16:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776697574] [2023-08-24 07:16:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:45,563 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 07:16:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776697574] [2023-08-24 07:16:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776697574] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35949742] [2023-08-24 07:16:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:45,565 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 07:16:45,575 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 07:16:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:45,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:45,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:45,774 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 07:16:45,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:16:45,823 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 07:16:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35949742] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:16:45,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:16:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2023-08-24 07:16:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137865584] [2023-08-24 07:16:45,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:16:45,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:16:45,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:45,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:16:45,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:45,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 293 [2023-08-24 07:16:45,831 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 07:16:45,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:45,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 293 [2023-08-24 07:16:45,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:47,994 INFO L124 PetriNetUnfolderBase]: 26332/31772 cut-off events. [2023-08-24 07:16:47,994 INFO L125 PetriNetUnfolderBase]: For 184435/184435 co-relation queries the response was YES. [2023-08-24 07:16:48,078 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 07:16:48,156 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 138 selfloop transitions, 12 changer transitions 47/197 dead transitions. [2023-08-24 07:16:48,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 197 transitions, 1762 flow [2023-08-24 07:16:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 07:16:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 07:16:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-24 07:16:48,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459613196814562 [2023-08-24 07:16:48,158 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-24 07:16:48,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-24 07:16:48,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:48,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-24 07:16:48,161 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 07:16:48,162 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 07:16:48,163 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 07:16:48,163 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 545 flow. Second operand 6 states and 808 transitions. [2023-08-24 07:16:48,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 197 transitions, 1762 flow [2023-08-24 07:16:48,549 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 07:16:48,550 INFO L231 Difference]: Finished difference. Result has 93 places, 70 transitions, 548 flow [2023-08-24 07:16:48,550 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 07:16:48,551 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-24 07:16:48,551 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 70 transitions, 548 flow [2023-08-24 07:16:48,551 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 07:16:48,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:48,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:16:48,558 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 07:16:48,751 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 07:16:48,752 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 07:16:48,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1490440730, now seen corresponding path program 2 times [2023-08-24 07:16:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635365455] [2023-08-24 07:16:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:48,957 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 07:16:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635365455] [2023-08-24 07:16:48,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635365455] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:48,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065007716] [2023-08-24 07:16:48,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:16:48,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:48,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:48,959 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 07:16:48,961 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 07:16:49,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 07:16:49,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:16:49,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:16:49,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:16:49,220 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 07:16:49,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 07:16:49,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065007716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:16:49,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 07:16:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 07:16:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879926584] [2023-08-24 07:16:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:16:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:16:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:16:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:16:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:16:49,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 07:16:49,222 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 07:16:49,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:16:49,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 07:16:49,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:16:51,124 INFO L124 PetriNetUnfolderBase]: 22304/26705 cut-off events. [2023-08-24 07:16:51,124 INFO L125 PetriNetUnfolderBase]: For 140725/140725 co-relation queries the response was YES. [2023-08-24 07:16:51,194 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 07:16:51,283 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 132 selfloop transitions, 9 changer transitions 0/141 dead transitions. [2023-08-24 07:16:51,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 1299 flow [2023-08-24 07:16:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 07:16:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 07:16:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-24 07:16:51,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974402730375427 [2023-08-24 07:16:51,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-24 07:16:51,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-24 07:16:51,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:16:51,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-24 07:16:51,287 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 07:16:51,288 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 07:16:51,288 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 07:16:51,289 INFO L175 Difference]: Start difference. First operand has 93 places, 70 transitions, 548 flow. Second operand 4 states and 583 transitions. [2023-08-24 07:16:51,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 1299 flow [2023-08-24 07:16:51,659 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 07:16:51,660 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 550 flow [2023-08-24 07:16:51,660 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 07:16:51,660 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-24 07:16:51,661 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 550 flow [2023-08-24 07:16:51,661 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 07:16:51,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:16:51,661 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 07:16:51,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-24 07:16:51,867 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 07:16:51,867 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 07:16:51,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:16:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash 460065354, now seen corresponding path program 1 times [2023-08-24 07:16:51,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:16:51,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937481880] [2023-08-24 07:16:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:16:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:16:52,228 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 07:16:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:16:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937481880] [2023-08-24 07:16:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937481880] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:16:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416659044] [2023-08-24 07:16:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:16:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:16:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:16:52,233 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 07:16:52,257 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 07:17:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:17:01,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-24 07:17:01,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:17:08,400 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 07:17:08,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:17:19,424 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 07:17:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416659044] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:17:19,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:17:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2023-08-24 07:17:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945728859] [2023-08-24 07:17:19,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:17:19,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 07:17:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:17:19,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 07:17:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=94, Unknown=6, NotChecked=0, Total=132 [2023-08-24 07:17:19,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 293 [2023-08-24 07:17:19,427 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 07:17:19,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:17:19,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 293 [2023-08-24 07:17:19,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:17:39,624 WARN L234 SmtUtils]: Spent 20.10s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:17:58,044 WARN L234 SmtUtils]: Spent 12.85s on a formula simplification. DAG size of input: 46 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:18:00,428 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 07:18:02,437 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 07:18:04,442 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 07:18:06,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:18:08,468 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 07:18:10,473 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 07:18:36,477 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:18:45,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:18:52,224 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 07:18:54,237 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 07:19:16,087 WARN L234 SmtUtils]: Spent 13.53s on a formula simplification. DAG size of input: 44 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:19:19,148 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 07:19:25,301 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 07:19:27,345 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 07:19:29,361 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 07:19:31,383 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 07:19:33,386 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 07:19:35,391 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 07:19:37,426 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 07:19:39,453 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 07:19:40,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:19:42,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:19:58,059 WARN L234 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 36 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:20:17,218 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 07:20:19,222 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 07:20:21,228 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 07:20:33,304 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 07:20:35,308 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 07:20:37,315 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 07:21:15,067 WARN L234 SmtUtils]: Spent 18.67s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:21:30,705 WARN L234 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 37 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:21:32,734 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 07:21:34,753 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 07:21:36,766 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 07:21:45,051 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 07:21:46,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:21:56,018 WARN L234 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 44 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:21:58,184 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 07:22:00,313 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 07:22:12,063 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 07:22:14,067 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 07:22:16,071 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 07:22:18,075 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 07:22:19,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:22:21,687 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 07:22:23,690 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 07:22:25,973 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 07:22:28,454 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 07:22:30,458 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 07:22:32,468 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 07:22:34,475 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 07:22:36,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:22:38,508 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 07:22:40,517 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))) (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) (let ((.cse6 (mod c_~x2~0 4294967296))) (or .cse3 (= .cse1 .cse6) .cse5 (< .cse6 .cse0))) (let ((.cse7 (* 2 c_~x6~0))) (<= .cse7 (+ (* (div (+ .cse7 (* (- 1) c_~x5~0)) 4294967296) 4294967296) c_~x5~0)))))) is different from false [2023-08-24 07:22:42,535 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 07:22:43,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:22:46,006 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 07:22:48,013 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 07:22:50,017 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 07:22:52,024 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 07:22:54,030 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 07:22:56,033 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 07:22:58,037 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 07:23:00,048 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 07:23:02,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x1~0 4294967296)) (.cse0 (mod c_~n~0 4294967296)) (.cse3 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (let ((.cse2 (mod c_~x2~0 4294967296))) (or (= .cse1 .cse2) (< .cse1 .cse0) (< .cse2 .cse0))) (< .cse3 .cse0) (= (mod (div c_~x2~0 2) 4294967296) .cse3) (= (mod c_~x1~0 2) 0))) is different from false [2023-08-24 07:23:04,374 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 07:23:14,427 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 07:23:40,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:23:51,677 WARN L234 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 36 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:23:53,683 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 07:23:55,688 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 07:23:57,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 07:23:59,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 07:24:01,741 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 07:24:03,751 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 07:24:05,939 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 07:24:07,944 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 07:24:09,954 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 07:25:12,472 WARN L234 SmtUtils]: Spent 44.06s on a formula simplification. DAG size of input: 32 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:25:14,478 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x1~0 4294967296)) (.cse0 (mod c_~n~0 4294967296))) (let ((.cse4 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse3 (< .cse1 .cse0))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (let ((.cse2 (mod c_~x2~0 4294967296))) (or (= .cse1 .cse2) .cse3 (< .cse2 .cse0))) (< .cse4 .cse0) (= (mod (div c_~x2~0 2) 4294967296) .cse4) (let ((.cse5 (* (mod c_~x2~0 2147483648) 2))) (or (<= .cse0 (mod c_~x5~0 4294967296)) (< .cse5 .cse0) (= .cse1 .cse5) .cse3)) (= (mod c_~x1~0 2) 0)))) is different from false [2023-08-24 07:25:19,768 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 07:25:21,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:25:23,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:25:25,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:25:27,953 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 07:26:28,926 WARN L234 SmtUtils]: Spent 26.83s on a formula simplification. DAG size of input: 41 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:26:30,929 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 07:26:32,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:26:34,957 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 07:26:37,071 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 07:26:39,078 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 07:26:41,087 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 07:26:43,093 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 07:26:45,100 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 07:26:47,105 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 07:26:49,112 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 07:26:51,120 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 07:26:53,128 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 07:26:55,461 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 07:26:56,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:26:58,888 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 07:27:00,895 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 07:27:02,898 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 07:27:04,906 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 07:27:06,913 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 07:27:08,919 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 07:27:10,933 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 07:27:12,938 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 07:27:14,945 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 07:27:16,969 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))) (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) (let ((.cse6 (mod c_~x2~0 4294967296))) (or .cse3 (= .cse1 .cse6) .cse5 (< .cse6 .cse0)))))) is different from false [2023-08-24 07:27:18,973 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 07:27:20,978 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 07:27:44,821 WARN L234 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:27: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 07:27:50,921 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 07:27:52,926 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 07:27:54,987 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 07:27:56,995 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 07:27:59,001 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 07:28:02,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:04,352 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 07:28:07,657 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 07:28:09,663 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 07:28:11,667 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 07:28:13,675 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 07:28:15,678 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 07:28:17,683 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 07:28:19,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 07:28:21,700 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 07:28:23,707 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 07:28:25,714 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 07:28:26,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:33,935 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 07:28:35,941 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 07:28:37,950 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 07:28:39,968 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 07:28:41,973 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 07:28:43,977 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 07:28:49,104 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 07:28:51,107 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 07:28:53,131 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 07:28:55,138 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 07:28:57,144 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 07:28:59,149 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 07:29:01,158 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 07:29:03,165 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 07:29:05,170 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 07:29:07,180 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 07:29:08,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:10,800 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 07:29:12,805 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 07:29:14,811 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 07:29:16,816 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 07:29:18,820 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 07:29:20,825 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 07:29:22,832 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 07:29:24,838 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 07:29:26,848 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 07:29:28,865 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 07:29:30,871 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 07:29:32,879 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 07:29:34,887 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 07:29:36,895 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 07:29:38,908 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 07:29:40,913 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 07:29:43,059 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 07:29:45,066 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 07:29:47,072 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 07:29:49,077 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 07:29:51,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:53,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:55,110 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 07:29:57,118 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 07:29:59,124 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 07:30:01,133 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 07:30:03,141 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 07:30:05,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:30:07,153 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 07:30:09,159 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 [] Received shutdown request... [2023-08-24 07:30:09,253 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 07:30:09,253 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 07:30:10,266 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 07:30:10,454 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 07:30:10,461 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 07:30:10,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 07:30:10,462 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-24 07:30:10,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2023-08-24 07:30:10,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 07:30:10,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 07:30:10,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 07:30:10,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 07:30:10,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2023-08-24 07:30:10,464 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:30:10,466 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 07:30:10,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 07:30:10,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 07:30:10 BasicIcfg [2023-08-24 07:30:10,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 07:30:10,471 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 07:30:10,471 INFO L158 Benchmark]: Toolchain (without parser) took 861079.96ms. Allocated memory was 371.2MB in the beginning and 14.6GB in the end (delta: 14.3GB). Free memory was 347.4MB in the beginning and 10.1GB in the end (delta: -9.8GB). Peak memory consumption was 4.6GB. Max. memory is 16.0GB. [2023-08-24 07:30:10,471 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 371.2MB. Free memory was 347.9MB in the beginning and 347.8MB in the end (delta: 78.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 07:30:10,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.22ms. Allocated memory is still 371.2MB. Free memory was 347.4MB in the beginning and 335.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 07:30:10,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.19ms. Allocated memory is still 371.2MB. Free memory was 335.7MB in the beginning and 333.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 07:30:10,472 INFO L158 Benchmark]: Boogie Preprocessor took 29.92ms. Allocated memory is still 371.2MB. Free memory was 333.7MB in the beginning and 332.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 07:30:10,472 INFO L158 Benchmark]: RCFGBuilder took 467.49ms. Allocated memory is still 371.2MB. Free memory was 332.0MB in the beginning and 314.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 07:30:10,472 INFO L158 Benchmark]: TraceAbstraction took 860261.29ms. Allocated memory was 371.2MB in the beginning and 14.6GB in the end (delta: 14.3GB). Free memory was 313.5MB in the beginning and 10.1GB in the end (delta: -9.8GB). Peak memory consumption was 4.6GB. Max. memory is 16.0GB. [2023-08-24 07:30:10,473 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 371.2MB. Free memory was 347.9MB in the beginning and 347.8MB in the end (delta: 78.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 271.22ms. Allocated memory is still 371.2MB. Free memory was 347.4MB in the beginning and 335.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.19ms. Allocated memory is still 371.2MB. Free memory was 335.7MB in the beginning and 333.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.92ms. Allocated memory is still 371.2MB. Free memory was 333.7MB in the beginning and 332.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 467.49ms. Allocated memory is still 371.2MB. Free memory was 332.0MB in the beginning and 314.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 860261.29ms. Allocated memory was 371.2MB in the beginning and 14.6GB in the end (delta: 14.3GB). Free memory was 313.5MB in the beginning and 10.1GB in the end (delta: -9.8GB). Peak memory consumption was 4.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 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 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 192 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 860.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 815.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 152 mSolverCounterUnknown, 1369 SdHoareTripleChecker+Valid, 359.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1369 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 357.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 509 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4481 IncrementalHoareTripleChecker+Invalid, 5213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 0 mSDtfsCounter, 4481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 626 SyntacticMatches, 21 SemanticMatches, 115 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 420.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=764occurred in iteration=13, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 10.6s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 1164 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1334 ConstructedInterpolants, 0 QuantifiedInterpolants, 23532 SizeOfPredicates, 98 NumberOfNonLiveVariables, 4221 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 40 InterpolantComputations, 15 PerfectInterpolantSequences, 105/134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown