/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread_bigshot_s2_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 01:20:32,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 01:20:32,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 01:20:32,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 01:20:32,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 01:20:32,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 01:20:32,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 01:20:32,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 01:20:32,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 01:20:32,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 01:20:32,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 01:20:32,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 01:20:32,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 01:20:32,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 01:20:32,676 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 01:20:32,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 01:20:32,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 01:20:32,677 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 01:20:32,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 01:20:32,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 01:20:32,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 01:20:32,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 01:20:32,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 01:20:32,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 01:20:32,683 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 01:20:32,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 01:20:32,684 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 01:20:32,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 01:20:32,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 01:20:32,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 01:20:32,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:20:32,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 01:20:32,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 01:20:32,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 01:20:32,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 01:20:32,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 01:20:32,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 01:20:32,687 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 01:20:32,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 01:20:32,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 01:20:32,687 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 01:20:32,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-04 01:20:32,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 01:20:32,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 01:20:32,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 01:20:32,868 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 01:20:32,868 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 01:20:32,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread_bigshot_s2_bound2.i [2023-08-04 01:20:33,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 01:20:34,082 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 01:20:34,083 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread_bigshot_s2_bound2.i [2023-08-04 01:20:34,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e8552d6/d1b73e36bfb04c798b70d005fa5ab575/FLAGef245df58 [2023-08-04 01:20:34,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e8552d6/d1b73e36bfb04c798b70d005fa5ab575 [2023-08-04 01:20:34,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 01:20:34,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 01:20:34,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 01:20:34,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 01:20:34,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 01:20:34,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbb5b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34, skipping insertion in model container [2023-08-04 01:20:34,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 01:20:34,429 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread_bigshot_s2_bound2.i[55203,55216] [2023-08-04 01:20:34,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:20:34,455 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 01:20:34,471 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [274] [2023-08-04 01:20:34,472 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [274] [2023-08-04 01:20:34,480 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread_bigshot_s2_bound2.i[55203,55216] [2023-08-04 01:20:34,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:20:34,539 INFO L206 MainTranslator]: Completed translation [2023-08-04 01:20:34,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34 WrapperNode [2023-08-04 01:20:34,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 01:20:34,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 01:20:34,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 01:20:34,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 01:20:34,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,591 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2023-08-04 01:20:34,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 01:20:34,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 01:20:34,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 01:20:34,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 01:20:34,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 01:20:34,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 01:20:34,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 01:20:34,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 01:20:34,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (1/1) ... [2023-08-04 01:20:34,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:20:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:34,641 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-04 01:20:34,643 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-04 01:20:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 01:20:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 01:20:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-04 01:20:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 01:20:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 01:20:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 01:20:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 01:20:34,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 01:20:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 01:20:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 01:20:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 01:20:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 01:20:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 01:20:34,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 01:20:34,667 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 01:20:34,791 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 01:20:34,792 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 01:20:34,944 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 01:20:34,950 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 01:20:34,950 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-04 01:20:34,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:20:34 BoogieIcfgContainer [2023-08-04 01:20:34,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 01:20:34,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 01:20:34,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 01:20:34,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 01:20:34,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 01:20:34" (1/3) ... [2023-08-04 01:20:34,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a92fa3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:20:34, skipping insertion in model container [2023-08-04 01:20:34,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:20:34" (2/3) ... [2023-08-04 01:20:34,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a92fa3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:20:34, skipping insertion in model container [2023-08-04 01:20:34,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:20:34" (3/3) ... [2023-08-04 01:20:34,959 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread_bigshot_s2_bound2.i [2023-08-04 01:20:34,963 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 01:20:34,969 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 01:20:34,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 01:20:34,969 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 01:20:35,011 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 01:20:35,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 112 transitions, 246 flow [2023-08-04 01:20:35,083 INFO L124 PetriNetUnfolderBase]: 27/242 cut-off events. [2023-08-04 01:20:35,083 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 01:20:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 242 events. 27/242 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 865 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2023-08-04 01:20:35,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 112 transitions, 246 flow [2023-08-04 01:20:35,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 110 transitions, 236 flow [2023-08-04 01:20:35,093 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:20:35,098 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 110 transitions, 236 flow [2023-08-04 01:20:35,100 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 110 transitions, 236 flow [2023-08-04 01:20:35,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 110 transitions, 236 flow [2023-08-04 01:20:35,139 INFO L124 PetriNetUnfolderBase]: 25/236 cut-off events. [2023-08-04 01:20:35,139 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 01:20:35,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 236 events. 25/236 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 841 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-04 01:20:35,142 INFO L119 LiptonReduction]: Number of co-enabled transitions 2256 [2023-08-04 01:20:37,110 INFO L134 LiptonReduction]: Checked pairs total: 4087 [2023-08-04 01:20:37,110 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 01:20:37,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:20:37,126 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=true, 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;@4ae8e8c9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:20:37,126 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 01:20:37,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:20:37,133 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-08-04 01:20:37,133 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 01:20:37,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:37,134 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 01:20:37,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:37,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash -244670440, now seen corresponding path program 1 times [2023-08-04 01:20:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:37,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107070536] [2023-08-04 01:20:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:20:37,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:20:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:20:37,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:20:37,301 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:20:37,302 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 01:20:37,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 01:20:37,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 01:20:37,303 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 01:20:37,308 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 01:20:37,309 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 01:20:37,309 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 01:20:37,330 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 01:20:37,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 142 transitions, 332 flow [2023-08-04 01:20:37,404 INFO L124 PetriNetUnfolderBase]: 106/812 cut-off events. [2023-08-04 01:20:37,405 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-04 01:20:37,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 812 events. 106/812 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4320 event pairs, 0 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 487. Up to 32 conditions per place. [2023-08-04 01:20:37,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 142 transitions, 332 flow [2023-08-04 01:20:37,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 140 transitions, 322 flow [2023-08-04 01:20:37,413 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:20:37,414 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 140 transitions, 322 flow [2023-08-04 01:20:37,414 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 140 transitions, 322 flow [2023-08-04 01:20:37,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 140 transitions, 322 flow [2023-08-04 01:20:37,474 INFO L124 PetriNetUnfolderBase]: 106/812 cut-off events. [2023-08-04 01:20:37,474 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-04 01:20:37,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 812 events. 106/812 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4324 event pairs, 0 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 487. Up to 32 conditions per place. [2023-08-04 01:20:37,488 INFO L119 LiptonReduction]: Number of co-enabled transitions 6168 [2023-08-04 01:20:39,623 INFO L134 LiptonReduction]: Checked pairs total: 14574 [2023-08-04 01:20:39,624 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 01:20:39,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:20:39,626 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=true, 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;@4ae8e8c9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:20:39,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 01:20:39,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:20:39,630 INFO L124 PetriNetUnfolderBase]: 10/79 cut-off events. [2023-08-04 01:20:39,630 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 01:20:39,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:39,630 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 01:20:39,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:39,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash 779767437, now seen corresponding path program 1 times [2023-08-04 01:20:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285928450] [2023-08-04 01:20:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:20:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:39,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285928450] [2023-08-04 01:20:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285928450] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:39,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943971211] [2023-08-04 01:20:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:39,761 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-04 01:20:39,776 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-04 01:20:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:39,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:20:39,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:20:39,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:20:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943971211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:20:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:20:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231294464] [2023-08-04 01:20:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:39,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:39,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:39,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:20:39,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 254 [2023-08-04 01:20:39,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 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-04 01:20:39,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:39,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 254 [2023-08-04 01:20:39,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:40,897 INFO L124 PetriNetUnfolderBase]: 12319/17758 cut-off events. [2023-08-04 01:20:40,897 INFO L125 PetriNetUnfolderBase]: For 947/947 co-relation queries the response was YES. [2023-08-04 01:20:40,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34930 conditions, 17758 events. 12319/17758 cut-off events. For 947/947 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 98913 event pairs, 4680 based on Foata normal form. 2040/14914 useless extension candidates. Maximal degree in co-relation 12138. Up to 16405 conditions per place. [2023-08-04 01:20:40,940 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 34 selfloop transitions, 5 changer transitions 13/58 dead transitions. [2023-08-04 01:20:40,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 256 flow [2023-08-04 01:20:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:20:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:20:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-04 01:20:40,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039370078740157 [2023-08-04 01:20:40,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-04 01:20:40,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-04 01:20:40,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:40,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-04 01:20:40,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 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-04 01:20:40,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-04 01:20:40,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-04 01:20:40,961 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 146 flow. Second operand 5 states and 640 transitions. [2023-08-04 01:20:40,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 256 flow [2023-08-04 01:20:40,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:20:40,966 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 115 flow [2023-08-04 01:20:40,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-04 01:20:40,970 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2023-08-04 01:20:40,970 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 115 flow [2023-08-04 01:20:40,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 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-04 01:20:40,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:40,970 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:40,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 01:20:41,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:41,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:41,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1387920147, now seen corresponding path program 1 times [2023-08-04 01:20:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439795578] [2023-08-04 01:20:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:20:41,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:41,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439795578] [2023-08-04 01:20:41,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439795578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:41,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:20:41,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:20:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060534326] [2023-08-04 01:20:41,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:41,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:20:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:20:41,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:20:41,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2023-08-04 01:20:41,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-04 01:20:41,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:41,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2023-08-04 01:20:41,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:41,509 INFO L124 PetriNetUnfolderBase]: 2974/4429 cut-off events. [2023-08-04 01:20:41,509 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2023-08-04 01:20:41,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8863 conditions, 4429 events. 2974/4429 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21317 event pairs, 1576 based on Foata normal form. 1/3518 useless extension candidates. Maximal degree in co-relation 1950. Up to 4030 conditions per place. [2023-08-04 01:20:41,527 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 32 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-04 01:20:41,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 186 flow [2023-08-04 01:20:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:20:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:20:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-04 01:20:41,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091863517060368 [2023-08-04 01:20:41,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-04 01:20:41,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-04 01:20:41,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:41,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-04 01:20:41,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-04 01:20:41,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-04 01:20:41,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-04 01:20:41,532 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 115 flow. Second operand 3 states and 388 transitions. [2023-08-04 01:20:41,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 186 flow [2023-08-04 01:20:41,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 183 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 01:20:41,536 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 111 flow [2023-08-04 01:20:41,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-08-04 01:20:41,538 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-08-04 01:20:41,538 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 111 flow [2023-08-04 01:20:41,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-04 01:20:41,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:41,538 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:41,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 01:20:41,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:41,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 226948766, now seen corresponding path program 1 times [2023-08-04 01:20:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250053819] [2023-08-04 01:20:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:20:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250053819] [2023-08-04 01:20:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250053819] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626624032] [2023-08-04 01:20:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:41,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:41,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:41,601 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-04 01:20:41,620 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-04 01:20:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:41,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:20:41,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 01:20:41,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:20:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626624032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:41,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:20:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:20:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779043744] [2023-08-04 01:20:41,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:41,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:20:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:20:41,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:41,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2023-08-04 01:20:41,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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-04 01:20:41,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:41,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2023-08-04 01:20:41,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:41,810 INFO L124 PetriNetUnfolderBase]: 1152/1841 cut-off events. [2023-08-04 01:20:41,810 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-08-04 01:20:41,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 1841 events. 1152/1841 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8358 event pairs, 740 based on Foata normal form. 0/1442 useless extension candidates. Maximal degree in co-relation 3646. Up to 1599 conditions per place. [2023-08-04 01:20:41,817 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 36 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-04 01:20:41,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 209 flow [2023-08-04 01:20:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:20:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:20:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-04 01:20:41,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144356955380578 [2023-08-04 01:20:41,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-04 01:20:41,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-04 01:20:41,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:41,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-04 01:20:41,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-04 01:20:41,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-04 01:20:41,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-04 01:20:41,821 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 111 flow. Second operand 3 states and 392 transitions. [2023-08-04 01:20:41,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 209 flow [2023-08-04 01:20:41,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:20:41,822 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 122 flow [2023-08-04 01:20:41,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-08-04 01:20:41,823 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-08-04 01:20:41,823 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 122 flow [2023-08-04 01:20:41,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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-04 01:20:41,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:41,824 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:41,830 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-04 01:20:42,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 01:20:42,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:42,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2029467110, now seen corresponding path program 1 times [2023-08-04 01:20:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:42,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201815330] [2023-08-04 01:20:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:42,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 01:20:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201815330] [2023-08-04 01:20:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201815330] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655064700] [2023-08-04 01:20:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:42,109 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-04 01:20:42,112 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-04 01:20:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:42,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:20:42,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 01:20:42,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 01:20:42,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655064700] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:42,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:20:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697543888] [2023-08-04 01:20:42,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:42,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:42,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 254 [2023-08-04 01:20:42,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 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-04 01:20:42,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:42,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 254 [2023-08-04 01:20:42,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:42,908 INFO L124 PetriNetUnfolderBase]: 1147/1828 cut-off events. [2023-08-04 01:20:42,908 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-04 01:20:42,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 1828 events. 1147/1828 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8143 event pairs, 463 based on Foata normal form. 3/1439 useless extension candidates. Maximal degree in co-relation 1253. Up to 1620 conditions per place. [2023-08-04 01:20:42,914 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 35 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-08-04 01:20:42,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 206 flow [2023-08-04 01:20:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:20:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:20:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-04 01:20:42,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49803149606299213 [2023-08-04 01:20:42,916 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-04 01:20:42,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-04 01:20:42,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:42,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-04 01:20:42,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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-04 01:20:42,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-04 01:20:42,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-04 01:20:42,919 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 122 flow. Second operand 4 states and 506 transitions. [2023-08-04 01:20:42,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 206 flow [2023-08-04 01:20:42,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:20:42,922 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 118 flow [2023-08-04 01:20:42,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-04 01:20:42,924 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-08-04 01:20:42,924 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 118 flow [2023-08-04 01:20:42,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 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-04 01:20:42,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:42,924 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:42,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 01:20:43,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:43,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:43,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash -634855026, now seen corresponding path program 1 times [2023-08-04 01:20:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:43,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367262446] [2023-08-04 01:20:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 01:20:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367262446] [2023-08-04 01:20:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367262446] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132004612] [2023-08-04 01:20:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:43,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:43,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:43,213 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-04 01:20:43,215 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-04 01:20:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:43,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:20:43,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 01:20:43,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 01:20:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132004612] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:43,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:20:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943962178] [2023-08-04 01:20:43,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:43,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:43,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 254 [2023-08-04 01:20:43,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 118 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-04 01:20:43,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:43,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 254 [2023-08-04 01:20:43,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:43,402 INFO L124 PetriNetUnfolderBase]: 179/344 cut-off events. [2023-08-04 01:20:43,403 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-08-04 01:20:43,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 344 events. 179/344 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1019 event pairs, 88 based on Foata normal form. 6/294 useless extension candidates. Maximal degree in co-relation 495. Up to 235 conditions per place. [2023-08-04 01:20:43,404 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 39 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 01:20:43,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 232 flow [2023-08-04 01:20:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:20:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:20:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-08-04 01:20:43,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029527559055118 [2023-08-04 01:20:43,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-08-04 01:20:43,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-08-04 01:20:43,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:43,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-08-04 01:20:43,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-04 01:20:43,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-04 01:20:43,409 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-04 01:20:43,409 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 118 flow. Second operand 4 states and 511 transitions. [2023-08-04 01:20:43,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 232 flow [2023-08-04 01:20:43,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 01:20:43,410 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 126 flow [2023-08-04 01:20:43,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-04 01:20:43,411 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-04 01:20:43,411 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 126 flow [2023-08-04 01:20:43,412 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-04 01:20:43,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:43,412 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:43,424 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-04 01:20:43,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:43,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:20:43,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -206428610, now seen corresponding path program 1 times [2023-08-04 01:20:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369532713] [2023-08-04 01:20:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:20:43,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369532713] [2023-08-04 01:20:43,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369532713] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277116021] [2023-08-04 01:20:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:43,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:43,684 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-04 01:20:43,686 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-04 01:20:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:43,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:20:43,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:20:43,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:20:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277116021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:43,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:20:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 01:20:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710273190] [2023-08-04 01:20:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:43,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:20:43,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 254 [2023-08-04 01:20:43,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 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-04 01:20:43,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:43,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 254 [2023-08-04 01:20:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:43,855 INFO L124 PetriNetUnfolderBase]: 139/273 cut-off events. [2023-08-04 01:20:43,856 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-08-04 01:20:43,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 273 events. 139/273 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 697 event pairs, 59 based on Foata normal form. 16/249 useless extension candidates. Maximal degree in co-relation 416. Up to 127 conditions per place. [2023-08-04 01:20:43,856 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2023-08-04 01:20:43,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 252 flow [2023-08-04 01:20:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:20:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:20:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-04 01:20:43,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49763779527559054 [2023-08-04 01:20:43,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-04 01:20:43,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-04 01:20:43,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:43,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-04 01:20:43,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-04 01:20:43,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-04 01:20:43,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-04 01:20:43,861 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 126 flow. Second operand 5 states and 632 transitions. [2023-08-04 01:20:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 252 flow [2023-08-04 01:20:43,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 245 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:20:43,863 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2023-08-04 01:20:43,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2023-08-04 01:20:43,864 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-04 01:20:43,865 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2023-08-04 01:20:43,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 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-04 01:20:43,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 01:20:43,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 01:20:43,870 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-04 01:20:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:44,070 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 01:20:44,071 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 01:20:44,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 142 transitions, 332 flow [2023-08-04 01:20:44,120 INFO L124 PetriNetUnfolderBase]: 106/812 cut-off events. [2023-08-04 01:20:44,121 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-04 01:20:44,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 812 events. 106/812 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4320 event pairs, 0 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 487. Up to 32 conditions per place. [2023-08-04 01:20:44,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 142 transitions, 332 flow [2023-08-04 01:20:44,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 139 transitions, 316 flow [2023-08-04 01:20:44,128 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:20:44,128 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 139 transitions, 316 flow [2023-08-04 01:20:44,128 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 139 transitions, 316 flow [2023-08-04 01:20:44,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 139 transitions, 316 flow [2023-08-04 01:20:44,172 INFO L124 PetriNetUnfolderBase]: 106/811 cut-off events. [2023-08-04 01:20:44,172 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-04 01:20:44,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 811 events. 106/811 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4324 event pairs, 0 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 484. Up to 32 conditions per place. [2023-08-04 01:20:44,185 INFO L119 LiptonReduction]: Number of co-enabled transitions 6144 [2023-08-04 01:20:46,214 INFO L134 LiptonReduction]: Checked pairs total: 14582 [2023-08-04 01:20:46,214 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-04 01:20:46,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 01:20:46,219 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=true, 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;@4ae8e8c9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:20:46,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 01:20:46,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:20:46,220 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 01:20:46,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:20:46,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:46,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:20:46,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:46,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash 782715884, now seen corresponding path program 1 times [2023-08-04 01:20:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943472495] [2023-08-04 01:20:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:46,239 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-04 01:20:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943472495] [2023-08-04 01:20:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943472495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:46,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:20:46,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:20:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293655246] [2023-08-04 01:20:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:46,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:20:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:20:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:20:46,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-08-04 01:20:46,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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-04 01:20:46,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:46,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-08-04 01:20:46,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:47,034 INFO L124 PetriNetUnfolderBase]: 13530/19426 cut-off events. [2023-08-04 01:20:47,034 INFO L125 PetriNetUnfolderBase]: For 954/954 co-relation queries the response was YES. [2023-08-04 01:20:47,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38218 conditions, 19426 events. 13530/19426 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 107425 event pairs, 7390 based on Foata normal form. 2200/16398 useless extension candidates. Maximal degree in co-relation 13254. Up to 18051 conditions per place. [2023-08-04 01:20:47,085 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 39 selfloop transitions, 2 changer transitions 6/53 dead transitions. [2023-08-04 01:20:47,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 236 flow [2023-08-04 01:20:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:20:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:20:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-04 01:20:47,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322793148880105 [2023-08-04 01:20:47,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-04 01:20:47,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-04 01:20:47,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:47,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-04 01:20:47,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 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-04 01:20:47,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:47,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:47,091 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 142 flow. Second operand 3 states and 404 transitions. [2023-08-04 01:20:47,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 236 flow [2023-08-04 01:20:47,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:20:47,094 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 129 flow [2023-08-04 01:20:47,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-04 01:20:47,095 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2023-08-04 01:20:47,095 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 129 flow [2023-08-04 01:20:47,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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-04 01:20:47,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:47,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:47,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 01:20:47,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:47,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 996167382, now seen corresponding path program 1 times [2023-08-04 01:20:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465756852] [2023-08-04 01:20:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:47,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:47,124 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-04 01:20:47,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:47,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465756852] [2023-08-04 01:20:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465756852] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042586973] [2023-08-04 01:20:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:47,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:47,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:47,129 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-04 01:20:47,131 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-04 01:20:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:47,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:20:47,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:47,198 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-04 01:20:47,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:20:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042586973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:20:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:20:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495214762] [2023-08-04 01:20:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:47,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:20:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:20:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:47,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-08-04 01:20:47,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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-04 01:20:47,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:47,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-08-04 01:20:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:47,393 INFO L124 PetriNetUnfolderBase]: 2752/4231 cut-off events. [2023-08-04 01:20:47,393 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-08-04 01:20:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 4231 events. 2752/4231 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20858 event pairs, 1784 based on Foata normal form. 0/3035 useless extension candidates. Maximal degree in co-relation 8342. Up to 3812 conditions per place. [2023-08-04 01:20:47,409 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 44 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 01:20:47,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 242 flow [2023-08-04 01:20:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:20:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:20:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-04 01:20:47,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5270092226613966 [2023-08-04 01:20:47,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-04 01:20:47,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-04 01:20:47,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:47,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-04 01:20:47,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-04 01:20:47,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:47,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:47,412 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 129 flow. Second operand 3 states and 400 transitions. [2023-08-04 01:20:47,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 242 flow [2023-08-04 01:20:47,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:20:47,415 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 137 flow [2023-08-04 01:20:47,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 01:20:47,416 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-08-04 01:20:47,416 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 137 flow [2023-08-04 01:20:47,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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-04 01:20:47,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:47,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:47,421 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-04 01:20:47,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:47,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:47,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1307901154, now seen corresponding path program 1 times [2023-08-04 01:20:47,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473083421] [2023-08-04 01:20:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:47,649 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-04 01:20:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473083421] [2023-08-04 01:20:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473083421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355434158] [2023-08-04 01:20:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:47,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:47,651 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-04 01:20:47,653 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-04 01:20:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:47,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:20:47,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:47,714 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-04 01:20:47,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:20:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355434158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:20:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:20:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440563454] [2023-08-04 01:20:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:47,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:20:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:20:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:47,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-08-04 01:20:47,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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-04 01:20:47,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:47,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-08-04 01:20:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:47,913 INFO L124 PetriNetUnfolderBase]: 2745/4189 cut-off events. [2023-08-04 01:20:47,913 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2023-08-04 01:20:47,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8331 conditions, 4189 events. 2745/4189 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20162 event pairs, 1151 based on Foata normal form. 0/3011 useless extension candidates. Maximal degree in co-relation 4638. Up to 3788 conditions per place. [2023-08-04 01:20:47,925 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 48 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-04 01:20:47,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 259 flow [2023-08-04 01:20:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:20:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:20:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-04 01:20:47,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530961791831357 [2023-08-04 01:20:47,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-04 01:20:47,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-04 01:20:47,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:47,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-04 01:20:47,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-04 01:20:47,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:47,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:47,929 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 137 flow. Second operand 3 states and 403 transitions. [2023-08-04 01:20:47,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 259 flow [2023-08-04 01:20:47,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:20:47,930 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 147 flow [2023-08-04 01:20:47,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-08-04 01:20:47,930 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-04 01:20:47,931 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 147 flow [2023-08-04 01:20:47,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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-04 01:20:47,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:47,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:47,935 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-04 01:20:48,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:48,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:48,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 103351372, now seen corresponding path program 1 times [2023-08-04 01:20:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850947674] [2023-08-04 01:20:48,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:48,167 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-04 01:20:48,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850947674] [2023-08-04 01:20:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850947674] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58777685] [2023-08-04 01:20:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:48,168 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-04 01:20:48,170 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-04 01:20:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:48,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:20:48,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:20:48,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:20:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58777685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:20:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 01:20:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628344548] [2023-08-04 01:20:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:48,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:20:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:20:48,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:48,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-08-04 01:20:48,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-04 01:20:48,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:48,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-08-04 01:20:48,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:48,447 INFO L124 PetriNetUnfolderBase]: 2616/4002 cut-off events. [2023-08-04 01:20:48,447 INFO L125 PetriNetUnfolderBase]: For 457/457 co-relation queries the response was YES. [2023-08-04 01:20:48,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8354 conditions, 4002 events. 2616/4002 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19143 event pairs, 1101 based on Foata normal form. 0/3099 useless extension candidates. Maximal degree in co-relation 4826. Up to 2427 conditions per place. [2023-08-04 01:20:48,459 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 58 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-04 01:20:48,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 317 flow [2023-08-04 01:20:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:20:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:20:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-04 01:20:48,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428194993412385 [2023-08-04 01:20:48,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-04 01:20:48,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-04 01:20:48,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:48,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-04 01:20:48,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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-04 01:20:48,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:48,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-04 01:20:48,462 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 147 flow. Second operand 3 states and 412 transitions. [2023-08-04 01:20:48,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 317 flow [2023-08-04 01:20:48,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:20:48,464 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 157 flow [2023-08-04 01:20:48,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-08-04 01:20:48,464 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2023-08-04 01:20:48,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 157 flow [2023-08-04 01:20:48,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-04 01:20:48,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:48,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:48,472 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-04 01:20:48,668 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,SelfDestructingSolverStorable10 [2023-08-04 01:20:48,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:48,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash 766515845, now seen corresponding path program 1 times [2023-08-04 01:20:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577572713] [2023-08-04 01:20:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:20:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577572713] [2023-08-04 01:20:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577572713] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624716691] [2023-08-04 01:20:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:48,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:48,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:48,704 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-04 01:20:48,724 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-04 01:20:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:48,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:20:48,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:20:48,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 01:20:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624716691] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:48,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:48,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:20:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310471838] [2023-08-04 01:20:48,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:48,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:48,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:48,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 253 [2023-08-04 01:20:48,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-04 01:20:48,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:48,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 253 [2023-08-04 01:20:48,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:49,005 INFO L124 PetriNetUnfolderBase]: 2611/4034 cut-off events. [2023-08-04 01:20:49,006 INFO L125 PetriNetUnfolderBase]: For 1148/1148 co-relation queries the response was YES. [2023-08-04 01:20:49,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 4034 events. 2611/4034 cut-off events. For 1148/1148 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19599 event pairs, 1132 based on Foata normal form. 3/3202 useless extension candidates. Maximal degree in co-relation 3769. Up to 3683 conditions per place. [2023-08-04 01:20:49,018 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 45 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2023-08-04 01:20:49,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 271 flow [2023-08-04 01:20:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:20:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:20:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-04 01:20:49,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508893280632411 [2023-08-04 01:20:49,019 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-04 01:20:49,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-04 01:20:49,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:49,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-04 01:20:49,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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-04 01:20:49,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:49,022 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:49,022 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 157 flow. Second operand 4 states and 515 transitions. [2023-08-04 01:20:49,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 271 flow [2023-08-04 01:20:49,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:20:49,025 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 169 flow [2023-08-04 01:20:49,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-08-04 01:20:49,025 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-04 01:20:49,025 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 169 flow [2023-08-04 01:20:49,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-04 01:20:49,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:49,026 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:49,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 01:20:49,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:49,230 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:49,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -71286524, now seen corresponding path program 1 times [2023-08-04 01:20:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932120428] [2023-08-04 01:20:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:20:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:49,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932120428] [2023-08-04 01:20:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932120428] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:49,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311731264] [2023-08-04 01:20:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:49,272 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-04 01:20:49,296 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-04 01:20:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:49,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:20:49,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:20:49,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:20:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311731264] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:49,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:20:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907056627] [2023-08-04 01:20:49,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:49,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:49,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 253 [2023-08-04 01:20:49,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 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-04 01:20:49,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:49,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 253 [2023-08-04 01:20:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:49,450 INFO L124 PetriNetUnfolderBase]: 311/567 cut-off events. [2023-08-04 01:20:49,450 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-08-04 01:20:49,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 567 events. 311/567 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1865 event pairs, 167 based on Foata normal form. 6/464 useless extension candidates. Maximal degree in co-relation 1015. Up to 444 conditions per place. [2023-08-04 01:20:49,452 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 47 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 01:20:49,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 291 flow [2023-08-04 01:20:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:20:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:20:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-04 01:20:49,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2023-08-04 01:20:49,453 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-04 01:20:49,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-04 01:20:49,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:49,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-04 01:20:49,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 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-04 01:20:49,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:49,458 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:49,458 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 169 flow. Second operand 4 states and 517 transitions. [2023-08-04 01:20:49,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 291 flow [2023-08-04 01:20:49,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 282 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:20:49,460 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 166 flow [2023-08-04 01:20:49,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-04 01:20:49,461 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-04 01:20:49,461 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 166 flow [2023-08-04 01:20:49,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 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-04 01:20:49,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:49,461 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:49,466 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-04 01:20:49,665 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,SelfDestructingSolverStorable12 [2023-08-04 01:20:49,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:49,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1913520626, now seen corresponding path program 1 times [2023-08-04 01:20:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583190716] [2023-08-04 01:20:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:49,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 01:20:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583190716] [2023-08-04 01:20:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583190716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:20:49,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:20:49,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 01:20:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016554873] [2023-08-04 01:20:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:20:49,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:20:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:20:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:20:49,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 253 [2023-08-04 01:20:49,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-04 01:20:49,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:49,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 253 [2023-08-04 01:20:49,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:49,826 INFO L124 PetriNetUnfolderBase]: 510/954 cut-off events. [2023-08-04 01:20:49,826 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2023-08-04 01:20:49,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 954 events. 510/954 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4028 event pairs, 305 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1193. Up to 449 conditions per place. [2023-08-04 01:20:49,829 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 73 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2023-08-04 01:20:49,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 475 flow [2023-08-04 01:20:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:20:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:20:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-04 01:20:49,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247035573122529 [2023-08-04 01:20:49,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-04 01:20:49,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-04 01:20:49,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:49,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-04 01:20:49,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-04 01:20:49,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:49,833 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:49,833 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 166 flow. Second operand 4 states and 531 transitions. [2023-08-04 01:20:49,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 475 flow [2023-08-04 01:20:49,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 01:20:49,835 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 176 flow [2023-08-04 01:20:49,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-04 01:20:49,836 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-04 01:20:49,836 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 176 flow [2023-08-04 01:20:49,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-04 01:20:49,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:49,837 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:20:49,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 01:20:49,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:49,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1896774648, now seen corresponding path program 2 times [2023-08-04 01:20:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234065293] [2023-08-04 01:20:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:20:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234065293] [2023-08-04 01:20:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234065293] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5112424] [2023-08-04 01:20:49,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 01:20:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:49,901 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-04 01:20:49,903 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-04 01:20:49,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 01:20:49,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:20:49,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:20:49,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:20:49,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:20:50,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5112424] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:50,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-08-04 01:20:50,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188978386] [2023-08-04 01:20:50,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 01:20:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 01:20:50,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:20:50,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 253 [2023-08-04 01:20:50,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 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-04 01:20:50,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:50,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 253 [2023-08-04 01:20:50,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:50,209 INFO L124 PetriNetUnfolderBase]: 439/833 cut-off events. [2023-08-04 01:20:50,209 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2023-08-04 01:20:50,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 833 events. 439/833 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3422 event pairs, 35 based on Foata normal form. 59/789 useless extension candidates. Maximal degree in co-relation 1166. Up to 265 conditions per place. [2023-08-04 01:20:50,211 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 97 selfloop transitions, 10 changer transitions 2/115 dead transitions. [2023-08-04 01:20:50,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 115 transitions, 628 flow [2023-08-04 01:20:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 01:20:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 01:20:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 988 transitions. [2023-08-04 01:20:50,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4881422924901186 [2023-08-04 01:20:50,213 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 988 transitions. [2023-08-04 01:20:50,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 988 transitions. [2023-08-04 01:20:50,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:50,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 988 transitions. [2023-08-04 01:20:50,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.5) internal successors, (988), 8 states have internal predecessors, (988), 0 states have call successors, (0), 0 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-04 01:20:50,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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-04 01:20:50,218 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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-04 01:20:50,218 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 176 flow. Second operand 8 states and 988 transitions. [2023-08-04 01:20:50,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 115 transitions, 628 flow [2023-08-04 01:20:50,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:20:50,220 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 227 flow [2023-08-04 01:20:50,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2023-08-04 01:20:50,220 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-04 01:20:50,220 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 227 flow [2023-08-04 01:20:50,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 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-04 01:20:50,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:50,221 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 01:20:50,225 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-04 01:20:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 01:20:50,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:50,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 207837606, now seen corresponding path program 1 times [2023-08-04 01:20:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447167943] [2023-08-04 01:20:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:20:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447167943] [2023-08-04 01:20:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447167943] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992295604] [2023-08-04 01:20:50,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:50,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:50,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:50,472 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-04 01:20:50,474 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-04 01:20:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:50,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:20:50,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:20:50,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 01:20:50,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992295604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:50,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:20:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129041537] [2023-08-04 01:20:50,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:50,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:20:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:20:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:20:50,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 253 [2023-08-04 01:20:50,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 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-04 01:20:50,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:50,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 253 [2023-08-04 01:20:50,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:50,680 INFO L124 PetriNetUnfolderBase]: 359/714 cut-off events. [2023-08-04 01:20:50,680 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2023-08-04 01:20:50,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 714 events. 359/714 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2812 event pairs, 143 based on Foata normal form. 16/646 useless extension candidates. Maximal degree in co-relation 1133. Up to 357 conditions per place. [2023-08-04 01:20:50,682 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 58 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2023-08-04 01:20:50,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 396 flow [2023-08-04 01:20:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:20:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:20:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-04 01:20:50,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516798418972332 [2023-08-04 01:20:50,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-04 01:20:50,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-04 01:20:50,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:50,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-04 01:20:50,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-04 01:20:50,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:50,696 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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-04 01:20:50,696 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 227 flow. Second operand 4 states and 523 transitions. [2023-08-04 01:20:50,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 396 flow [2023-08-04 01:20:50,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 382 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 01:20:50,698 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 228 flow [2023-08-04 01:20:50,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-08-04 01:20:50,698 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2023-08-04 01:20:50,699 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 228 flow [2023-08-04 01:20:50,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 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-04 01:20:50,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:50,699 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:20:50,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 01:20:50,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 01:20:50,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:50,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1093432245, now seen corresponding path program 1 times [2023-08-04 01:20:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:50,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826769047] [2023-08-04 01:20:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 01:20:51,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826769047] [2023-08-04 01:20:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826769047] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66368918] [2023-08-04 01:20:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:51,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:51,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:51,469 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-04 01:20:51,471 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-04 01:20:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:51,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 01:20:51,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:51,600 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-04 01:20:51,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-04 01:20:51,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:51,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:51,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:51,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:20:51,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:20:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66368918] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:51,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2023-08-04 01:20:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981530081] [2023-08-04 01:20:51,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:51,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 01:20:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 01:20:51,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-08-04 01:20:52,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 253 [2023-08-04 01:20:52,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 228 flow. Second operand has 19 states, 19 states have (on average 102.84210526315789) internal successors, (1954), 19 states have internal predecessors, (1954), 0 states have call successors, (0), 0 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-04 01:20:52,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:52,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 253 [2023-08-04 01:20:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:53,351 INFO L124 PetriNetUnfolderBase]: 1451/2410 cut-off events. [2023-08-04 01:20:53,351 INFO L125 PetriNetUnfolderBase]: For 3019/3019 co-relation queries the response was YES. [2023-08-04 01:20:53,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6376 conditions, 2410 events. 1451/2410 cut-off events. For 3019/3019 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12051 event pairs, 164 based on Foata normal form. 0/2008 useless extension candidates. Maximal degree in co-relation 6043. Up to 611 conditions per place. [2023-08-04 01:20:53,361 INFO L140 encePairwiseOnDemand]: 242/253 looper letters, 250 selfloop transitions, 84 changer transitions 0/339 dead transitions. [2023-08-04 01:20:53,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 339 transitions, 2251 flow [2023-08-04 01:20:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-04 01:20:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-04 01:20:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3240 transitions. [2023-08-04 01:20:53,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268774703557312 [2023-08-04 01:20:53,366 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3240 transitions. [2023-08-04 01:20:53,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3240 transitions. [2023-08-04 01:20:53,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:20:53,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3240 transitions. [2023-08-04 01:20:53,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 108.0) internal successors, (3240), 30 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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-04 01:20:53,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 253.0) internal successors, (7843), 31 states have internal predecessors, (7843), 0 states have call successors, (0), 0 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-04 01:20:53,379 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 253.0) internal successors, (7843), 31 states have internal predecessors, (7843), 0 states have call successors, (0), 0 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-04 01:20:53,379 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 228 flow. Second operand 30 states and 3240 transitions. [2023-08-04 01:20:53,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 339 transitions, 2251 flow [2023-08-04 01:20:53,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 339 transitions, 2190 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 01:20:53,386 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 703 flow [2023-08-04 01:20:53,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=703, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2023-08-04 01:20:53,386 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 61 predicate places. [2023-08-04 01:20:53,387 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 703 flow [2023-08-04 01:20:53,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 102.84210526315789) internal successors, (1954), 19 states have internal predecessors, (1954), 0 states have call successors, (0), 0 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-04 01:20:53,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:20:53,387 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:20:53,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 01:20:53,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 01:20:53,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:20:53,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:20:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1892760861, now seen corresponding path program 2 times [2023-08-04 01:20:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:20:53,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893651351] [2023-08-04 01:20:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:20:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:20:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:20:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 01:20:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:20:54,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893651351] [2023-08-04 01:20:54,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893651351] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:20:54,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740590660] [2023-08-04 01:20:54,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 01:20:54,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:20:54,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:20:54,089 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:20:54,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 01:20:54,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 01:20:54,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:20:54,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-04 01:20:54,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:20:54,212 INFO L322 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-08-04 01:20:54,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2023-08-04 01:20:54,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:54,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:54,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:54,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:20:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 01:20:54,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:20:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 01:20:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740590660] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:20:54,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:20:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2023-08-04 01:20:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700717221] [2023-08-04 01:20:54,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:20:54,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 01:20:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:20:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 01:20:54,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-08-04 01:20:55,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 253 [2023-08-04 01:20:55,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 703 flow. Second operand has 21 states, 21 states have (on average 100.95238095238095) internal successors, (2120), 21 states have internal predecessors, (2120), 0 states have call successors, (0), 0 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-04 01:20:55,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:20:55,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 253 [2023-08-04 01:20:55,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:20:57,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:21:00,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:21:00,649 INFO L124 PetriNetUnfolderBase]: 3197/5010 cut-off events. [2023-08-04 01:21:00,649 INFO L125 PetriNetUnfolderBase]: For 29393/29491 co-relation queries the response was YES. [2023-08-04 01:21:00,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20740 conditions, 5010 events. 3197/5010 cut-off events. For 29393/29491 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 27622 event pairs, 263 based on Foata normal form. 320/5129 useless extension candidates. Maximal degree in co-relation 20157. Up to 1427 conditions per place. [2023-08-04 01:21:00,675 INFO L140 encePairwiseOnDemand]: 241/253 looper letters, 257 selfloop transitions, 213 changer transitions 0/488 dead transitions. [2023-08-04 01:21:00,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 488 transitions, 3848 flow [2023-08-04 01:21:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-04 01:21:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-04 01:21:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3140 transitions. [2023-08-04 01:21:00,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4137022397891963 [2023-08-04 01:21:00,683 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3140 transitions. [2023-08-04 01:21:00,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3140 transitions. [2023-08-04 01:21:00,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:21:00,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3140 transitions. [2023-08-04 01:21:00,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 104.66666666666667) internal successors, (3140), 30 states have internal predecessors, (3140), 0 states have call successors, (0), 0 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-04 01:21:00,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 253.0) internal successors, (7843), 31 states have internal predecessors, (7843), 0 states have call successors, (0), 0 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-04 01:21:00,696 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 253.0) internal successors, (7843), 31 states have internal predecessors, (7843), 0 states have call successors, (0), 0 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-04 01:21:00,696 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 703 flow. Second operand 30 states and 3140 transitions. [2023-08-04 01:21:00,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 488 transitions, 3848 flow [2023-08-04 01:21:00,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 488 transitions, 3840 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 01:21:00,757 INFO L231 Difference]: Finished difference. Result has 144 places, 293 transitions, 2404 flow [2023-08-04 01:21:00,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2404, PETRI_PLACES=144, PETRI_TRANSITIONS=293} [2023-08-04 01:21:00,757 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 96 predicate places. [2023-08-04 01:21:00,757 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 293 transitions, 2404 flow [2023-08-04 01:21:00,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 100.95238095238095) internal successors, (2120), 21 states have internal predecessors, (2120), 0 states have call successors, (0), 0 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-04 01:21:00,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:21:00,758 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:21:00,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 01:21:00,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:21:00,963 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:21:00,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:21:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1287253382, now seen corresponding path program 1 times [2023-08-04 01:21:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:21:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688921251] [2023-08-04 01:21:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:21:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:21:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:21:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 01:21:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:21:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688921251] [2023-08-04 01:21:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688921251] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:21:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719715411] [2023-08-04 01:21:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:21:01,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:21:01,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:21:01,471 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:21:01,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 01:21:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:21:01,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 01:21:01,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:21:01,693 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-04 01:21:01,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2023-08-04 01:21:01,739 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:21:01,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-08-04 01:21:01,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-08-04 01:21:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:21:01,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:21:01,922 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 01:21:01,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 209 [2023-08-04 01:21:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:21:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719715411] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:21:02,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:21:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2023-08-04 01:21:02,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369347920] [2023-08-04 01:21:02,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:21:02,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 01:21:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:21:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 01:21:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2023-08-04 01:21:04,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 253 [2023-08-04 01:21:04,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 293 transitions, 2404 flow. Second operand has 24 states, 24 states have (on average 94.95833333333333) internal successors, (2279), 24 states have internal predecessors, (2279), 0 states have call successors, (0), 0 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-04 01:21:04,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:21:04,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 253 [2023-08-04 01:21:04,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:21:10,566 INFO L124 PetriNetUnfolderBase]: 6943/10516 cut-off events. [2023-08-04 01:21:10,566 INFO L125 PetriNetUnfolderBase]: For 91961/91961 co-relation queries the response was YES. [2023-08-04 01:21:10,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56895 conditions, 10516 events. 6943/10516 cut-off events. For 91961/91961 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 62247 event pairs, 577 based on Foata normal form. 383/10814 useless extension candidates. Maximal degree in co-relation 55301. Up to 1915 conditions per place. [2023-08-04 01:21:10,625 INFO L140 encePairwiseOnDemand]: 240/253 looper letters, 709 selfloop transitions, 768 changer transitions 0/1481 dead transitions. [2023-08-04 01:21:10,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 1481 transitions, 15552 flow [2023-08-04 01:21:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-08-04 01:21:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-08-04 01:21:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 9615 transitions. [2023-08-04 01:21:10,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39179332545536044 [2023-08-04 01:21:10,634 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 9615 transitions. [2023-08-04 01:21:10,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 9615 transitions. [2023-08-04 01:21:10,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:21:10,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 9615 transitions. [2023-08-04 01:21:10,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 99.12371134020619) internal successors, (9615), 97 states have internal predecessors, (9615), 0 states have call successors, (0), 0 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-04 01:21:10,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 253.0) internal successors, (24794), 98 states have internal predecessors, (24794), 0 states have call successors, (0), 0 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-04 01:21:10,665 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 253.0) internal successors, (24794), 98 states have internal predecessors, (24794), 0 states have call successors, (0), 0 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-04 01:21:10,665 INFO L175 Difference]: Start difference. First operand has 144 places, 293 transitions, 2404 flow. Second operand 97 states and 9615 transitions. [2023-08-04 01:21:10,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 1481 transitions, 15552 flow [2023-08-04 01:21:11,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1481 transitions, 14364 flow, removed 591 selfloop flow, removed 2 redundant places. [2023-08-04 01:21:11,272 INFO L231 Difference]: Finished difference. Result has 290 places, 929 transitions, 10679 flow [2023-08-04 01:21:11,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=10679, PETRI_PLACES=290, PETRI_TRANSITIONS=929} [2023-08-04 01:21:11,273 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 242 predicate places. [2023-08-04 01:21:11,273 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 929 transitions, 10679 flow [2023-08-04 01:21:11,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 94.95833333333333) internal successors, (2279), 24 states have internal predecessors, (2279), 0 states have call successors, (0), 0 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-04 01:21:11,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:21:11,274 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:21:11,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 01:21:11,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:21:11,478 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:21:11,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:21:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1106266704, now seen corresponding path program 2 times [2023-08-04 01:21:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:21:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155715172] [2023-08-04 01:21:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:21:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:21:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:21:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:21:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:21:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155715172] [2023-08-04 01:21:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155715172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:21:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894250436] [2023-08-04 01:21:11,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 01:21:11,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:21:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:21:11,833 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:21:11,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 01:21:11,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 01:21:11,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:21:11,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 01:21:11,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:21:12,114 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-04 01:21:12,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2023-08-04 01:21:12,153 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:21:12,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-08-04 01:21:12,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-08-04 01:21:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 01:21:12,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:21:12,352 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 01:21:12,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 209 [2023-08-04 01:21:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 01:21:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894250436] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:21:12,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:21:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2023-08-04 01:21:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304134871] [2023-08-04 01:21:12,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:21:12,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 01:21:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:21:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 01:21:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2023-08-04 01:21:13,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 253 [2023-08-04 01:21:13,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 929 transitions, 10679 flow. Second operand has 24 states, 24 states have (on average 93.375) internal successors, (2241), 24 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-04 01:21:13,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:21:13,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 253 [2023-08-04 01:21:13,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:21:22,077 INFO L124 PetriNetUnfolderBase]: 10960/16454 cut-off events. [2023-08-04 01:21:22,077 INFO L125 PetriNetUnfolderBase]: For 224262/224262 co-relation queries the response was YES. [2023-08-04 01:21:22,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114975 conditions, 16454 events. 10960/16454 cut-off events. For 224262/224262 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 103980 event pairs, 863 based on Foata normal form. 374/16826 useless extension candidates. Maximal degree in co-relation 113957. Up to 3392 conditions per place. [2023-08-04 01:21:22,239 INFO L140 encePairwiseOnDemand]: 240/253 looper letters, 937 selfloop transitions, 1252 changer transitions 0/2193 dead transitions. [2023-08-04 01:21:22,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 2193 transitions, 29146 flow [2023-08-04 01:21:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-08-04 01:21:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2023-08-04 01:21:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 9136 transitions. [2023-08-04 01:21:22,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38415608443360527 [2023-08-04 01:21:22,247 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 9136 transitions. [2023-08-04 01:21:22,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 9136 transitions. [2023-08-04 01:21:22,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:21:22,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 9136 transitions. [2023-08-04 01:21:22,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 97.19148936170212) internal successors, (9136), 94 states have internal predecessors, (9136), 0 states have call successors, (0), 0 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-04 01:21:22,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 253.0) internal successors, (24035), 95 states have internal predecessors, (24035), 0 states have call successors, (0), 0 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-04 01:21:22,270 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 253.0) internal successors, (24035), 95 states have internal predecessors, (24035), 0 states have call successors, (0), 0 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-04 01:21:22,270 INFO L175 Difference]: Start difference. First operand has 290 places, 929 transitions, 10679 flow. Second operand 94 states and 9136 transitions. [2023-08-04 01:21:22,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 2193 transitions, 29146 flow [2023-08-04 01:21:25,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 2193 transitions, 27622 flow, removed 699 selfloop flow, removed 12 redundant places. [2023-08-04 01:21:25,064 INFO L231 Difference]: Finished difference. Result has 416 places, 1606 transitions, 22151 flow [2023-08-04 01:21:25,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=9645, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=622, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=22151, PETRI_PLACES=416, PETRI_TRANSITIONS=1606} [2023-08-04 01:21:25,064 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 368 predicate places. [2023-08-04 01:21:25,064 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 1606 transitions, 22151 flow [2023-08-04 01:21:25,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 93.375) internal successors, (2241), 24 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-04 01:21:25,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:21:25,065 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:21:25,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-04 01:21:25,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:21:25,265 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:21:25,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:21:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1064940067, now seen corresponding path program 1 times [2023-08-04 01:21:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:21:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892199819] [2023-08-04 01:21:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:21:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:21:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:21:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:21:25,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:21:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892199819] [2023-08-04 01:21:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892199819] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:21:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645504262] [2023-08-04 01:21:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:21:25,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:21:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:21:25,813 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:21:25,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 01:21:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:21:25,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-04 01:21:25,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:21:25,942 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-04 01:21:25,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-04 01:21:25,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:21:26,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:21:26,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:21:26,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:21:26,273 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-04 01:21:26,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-04 01:21:26,416 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-04 01:21:26,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 01:21:26,478 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:21:26,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-04 01:21:26,556 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:21:26,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-04 01:21:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 01:21:26,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:21:27,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (~v~0.base Int)) (= 66 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612))) (store .cse0 ~v~0.base (store (select .cse0 ~v~0.base) c_~v~0.offset (select (select .cse0 3) 0)))) 3) 0))) is different from false [2023-08-04 01:21:27,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (~v~0.base Int)) (= 66 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612))) (store .cse0 ~v~0.base (store (select .cse0 ~v~0.base) |c_thread1Thread2of2ForFork0_#t~malloc3.offset| (select (select .cse0 3) 0)))) 3) 0))) is different from false [2023-08-04 01:21:27,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (~v~0.base Int)) (= 66 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612))) (store .cse0 ~v~0.base (store (select .cse0 ~v~0.base) 0 (select (select .cse0 3) 0)))) 3) 0))) is different from false [2023-08-04 01:21:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2023-08-04 01:21:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645504262] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:21:27,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:21:27,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 36 [2023-08-04 01:21:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989782078] [2023-08-04 01:21:27,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:21:27,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-04 01:21:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:21:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-04 01:21:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=973, Unknown=18, NotChecked=198, Total=1332 [2023-08-04 01:21:27,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 253 [2023-08-04 01:21:27,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 1606 transitions, 22151 flow. Second operand has 37 states, 37 states have (on average 76.48648648648648) internal successors, (2830), 37 states have internal predecessors, (2830), 0 states have call successors, (0), 0 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-04 01:21:27,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:21:27,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 253 [2023-08-04 01:21:27,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:22:16,767 INFO L124 PetriNetUnfolderBase]: 15588/23459 cut-off events. [2023-08-04 01:22:16,767 INFO L125 PetriNetUnfolderBase]: For 644286/644286 co-relation queries the response was YES. [2023-08-04 01:22:17,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197291 conditions, 23459 events. 15588/23459 cut-off events. For 644286/644286 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 156606 event pairs, 1448 based on Foata normal form. 108/23563 useless extension candidates. Maximal degree in co-relation 196135. Up to 15000 conditions per place. [2023-08-04 01:22:17,117 INFO L140 encePairwiseOnDemand]: 232/253 looper letters, 2073 selfloop transitions, 872 changer transitions 25/2974 dead transitions. [2023-08-04 01:22:17,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 2974 transitions, 44860 flow [2023-08-04 01:22:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2023-08-04 01:22:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2023-08-04 01:22:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 8017 transitions. [2023-08-04 01:22:17,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.320078252884577 [2023-08-04 01:22:17,131 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 8017 transitions. [2023-08-04 01:22:17,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 8017 transitions. [2023-08-04 01:22:17,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:22:17,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 8017 transitions. [2023-08-04 01:22:17,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 80.97979797979798) internal successors, (8017), 99 states have internal predecessors, (8017), 0 states have call successors, (0), 0 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-04 01:22:17,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 253.0) internal successors, (25300), 100 states have internal predecessors, (25300), 0 states have call successors, (0), 0 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-04 01:22:17,176 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 253.0) internal successors, (25300), 100 states have internal predecessors, (25300), 0 states have call successors, (0), 0 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-04 01:22:17,176 INFO L175 Difference]: Start difference. First operand has 416 places, 1606 transitions, 22151 flow. Second operand 99 states and 8017 transitions. [2023-08-04 01:22:17,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 2974 transitions, 44860 flow [2023-08-04 01:22:28,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 2974 transitions, 42019 flow, removed 1043 selfloop flow, removed 22 redundant places. [2023-08-04 01:22:28,791 INFO L231 Difference]: Finished difference. Result has 536 places, 2264 transitions, 33200 flow [2023-08-04 01:22:28,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=19962, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=33200, PETRI_PLACES=536, PETRI_TRANSITIONS=2264} [2023-08-04 01:22:28,792 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 488 predicate places. [2023-08-04 01:22:28,792 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 2264 transitions, 33200 flow [2023-08-04 01:22:28,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 76.48648648648648) internal successors, (2830), 37 states have internal predecessors, (2830), 0 states have call successors, (0), 0 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-04 01:22:28,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:22:28,792 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:22:28,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 01:22:28,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:22:28,997 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:22:28,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:22:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash -269667877, now seen corresponding path program 2 times [2023-08-04 01:22:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:22:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055045229] [2023-08-04 01:22:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:22:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:22:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:22:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 01:22:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:22:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055045229] [2023-08-04 01:22:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055045229] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:22:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309119402] [2023-08-04 01:22:29,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 01:22:29,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:22:29,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:22:29,415 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:22:29,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 01:22:29,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 01:22:29,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:22:29,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-04 01:22:29,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:22:29,553 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-04 01:22:29,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-08-04 01:22:29,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:29,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:29,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:29,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:29,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 01:22:29,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-04 01:22:30,049 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-04 01:22:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:22:30,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:22:30,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 394 [2023-08-04 01:22:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:22:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309119402] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:22:30,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:22:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 29 [2023-08-04 01:22:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404984580] [2023-08-04 01:22:30,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:22:30,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 01:22:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:22:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 01:22:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2023-08-04 01:22:33,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 253 [2023-08-04 01:22:33,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 2264 transitions, 33200 flow. Second operand has 30 states, 30 states have (on average 97.66666666666667) internal successors, (2930), 30 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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-04 01:22:33,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:22:33,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 253 [2023-08-04 01:22:33,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:22:44,429 INFO L124 PetriNetUnfolderBase]: 15625/24433 cut-off events. [2023-08-04 01:22:44,429 INFO L125 PetriNetUnfolderBase]: For 720754/722156 co-relation queries the response was YES. [2023-08-04 01:22:44,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210275 conditions, 24433 events. 15625/24433 cut-off events. For 720754/722156 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 175658 event pairs, 1276 based on Foata normal form. 537/24902 useless extension candidates. Maximal degree in co-relation 210042. Up to 17375 conditions per place. [2023-08-04 01:22:44,799 INFO L140 encePairwiseOnDemand]: 240/253 looper letters, 2208 selfloop transitions, 630 changer transitions 9/3031 dead transitions. [2023-08-04 01:22:44,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 3031 transitions, 48660 flow [2023-08-04 01:22:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-04 01:22:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-04 01:22:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 5249 transitions. [2023-08-04 01:22:44,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40680461908083393 [2023-08-04 01:22:44,803 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 5249 transitions. [2023-08-04 01:22:44,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 5249 transitions. [2023-08-04 01:22:44,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:22:44,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 5249 transitions. [2023-08-04 01:22:44,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 102.92156862745098) internal successors, (5249), 51 states have internal predecessors, (5249), 0 states have call successors, (0), 0 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-04 01:22:44,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 253.0) internal successors, (13156), 52 states have internal predecessors, (13156), 0 states have call successors, (0), 0 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-04 01:22:44,814 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 253.0) internal successors, (13156), 52 states have internal predecessors, (13156), 0 states have call successors, (0), 0 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-04 01:22:44,814 INFO L175 Difference]: Start difference. First operand has 536 places, 2264 transitions, 33200 flow. Second operand 51 states and 5249 transitions. [2023-08-04 01:22:44,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 3031 transitions, 48660 flow [2023-08-04 01:22:58,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 3031 transitions, 46595 flow, removed 780 selfloop flow, removed 15 redundant places. [2023-08-04 01:22:58,459 INFO L231 Difference]: Finished difference. Result has 597 places, 2691 transitions, 40706 flow [2023-08-04 01:22:58,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=31271, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=40706, PETRI_PLACES=597, PETRI_TRANSITIONS=2691} [2023-08-04 01:22:58,460 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 549 predicate places. [2023-08-04 01:22:58,460 INFO L495 AbstractCegarLoop]: Abstraction has has 597 places, 2691 transitions, 40706 flow [2023-08-04 01:22:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 97.66666666666667) internal successors, (2930), 30 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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-04 01:22:58,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:22:58,461 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04 01:22:58,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 01:22:58,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:22:58,661 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:22:58,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:22:58,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1640396931, now seen corresponding path program 3 times [2023-08-04 01:22:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:22:58,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464667223] [2023-08-04 01:22:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:22:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:22:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:22:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 01:22:59,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:22:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464667223] [2023-08-04 01:22:59,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464667223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:22:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405536768] [2023-08-04 01:22:59,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 01:22:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:22:59,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:22:59,027 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:22:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 01:22:59,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 01:22:59,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 01:22:59,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-04 01:22:59,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:22:59,172 INFO L322 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-08-04 01:22:59,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2023-08-04 01:22:59,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:59,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:59,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:59,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 01:22:59,595 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-04 01:22:59,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-04 01:22:59,661 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-04 01:22:59,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 01:22:59,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 01:22:59,723 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:22:59,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-04 01:22:59,764 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:22:59,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-04 01:22:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:22:59,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:23:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:23:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405536768] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:23:14,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:23:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 35 [2023-08-04 01:23:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113105630] [2023-08-04 01:23:14,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:23:14,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-04 01:23:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:23:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-04 01:23:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1108, Unknown=4, NotChecked=0, Total=1260 [2023-08-04 01:23:14,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 253 [2023-08-04 01:23:14,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 2691 transitions, 40706 flow. Second operand has 36 states, 36 states have (on average 71.5) internal successors, (2574), 36 states have internal predecessors, (2574), 0 states have call successors, (0), 0 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-04 01:23:14,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:23:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 253 [2023-08-04 01:23:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:23:22,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:23:46,557 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 81 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:24:00,262 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 95 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:24:03,413 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 [1] [2023-08-04 01:24:22,812 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 [1] [2023-08-04 01:24:25,608 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 [1] [2023-08-04 01:24:26,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:24:38,173 WARN L233 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 97 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:24:40,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:24:46,581 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 110 DAG size of output: 109 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:25:21,670 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 [1] [2023-08-04 01:25:35,784 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 [1] [2023-08-04 01:25:37,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:25:46,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:26:00,768 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 99 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:26:03,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:26:05,796 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 [1] [2023-08-04 01:26:12,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:26:18,757 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 [1] [2023-08-04 01:26:22,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:26:31,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:26:33,507 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base|)) (.cse3 (+ |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1| |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.offset|))) (let ((.cse7 (store |c_#memory_int| |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store .cse13 .cse3 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~mem18#1|))) (.cse16 (select |c_#memory_int| 3))) (let ((.cse11 (select .cse16 0)) (.cse1 (+ |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.offset| 1)) (.cse8 (select .cse7 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|)) (.cse4 (+ |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.offset|)) (.cse9 (+ |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| 2)) (forall ((v_ArrVal_742 Int) (v_ArrVal_744 Int)) (= 66 (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select |c_#memory_int| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) .cse4 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_#t~mem18#1|)))) (store .cse2 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse2 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) .cse3 v_ArrVal_742))))) (store .cse0 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse0 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) .cse1 v_ArrVal_744))) c_~v~0.base) c_~v~0.offset))) (forall ((v_ArrVal_742 Int) (|v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77| Int) (v_ArrVal_744 Int)) (or (= 66 (select (select (let ((.cse5 (let ((.cse6 (store .cse7 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store .cse8 .cse4 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_#t~mem18#1|)))) (store .cse6 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse6 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) (+ |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.offset| |v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77|) v_ArrVal_742))))) (store .cse5 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse5 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) .cse1 v_ArrVal_744))) c_~v~0.base) c_~v~0.offset)) (< |v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77| .cse9))) (not (= 2 |c_ULTIMATE.start_main_~#t2~0#1.base|)) (forall ((v_ArrVal_742 Int) (|v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77| Int)) (or (= (select (select (let ((.cse10 (store .cse7 c_~v~0.base (store (select .cse7 c_~v~0.base) c_~v~0.offset .cse11)))) (store .cse10 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse10 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) (+ |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.offset| |v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77|) v_ArrVal_742))) c_~v~0.base) c_~v~0.offset) 66) (< |v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77| .cse9))) (= 66 .cse11) (= c_~v~0.offset 0) (= |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1| 1) (= |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_src#1.offset| 0) (forall ((v_ArrVal_742 Int) (v_ArrVal_744 Int)) (= 66 (select (select (let ((.cse12 (store |c_#memory_int| |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store .cse13 .cse3 v_ArrVal_742)))) (store .cse12 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse12 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) .cse4 v_ArrVal_744))) c_~v~0.base) c_~v~0.offset))) (not (= 3 |c_ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (select |c_#valid| 3) 0)) (forall ((v_ArrVal_742 Int) (|v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77| Int) (v_ArrVal_744 Int)) (or (= (select (select (let ((.cse14 (let ((.cse15 (store .cse7 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store .cse8 .cse4 (select (select |c_#memory_int| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_src#1.offset|)))))) (store .cse15 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse15 |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) (+ |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.offset| |v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77|) v_ArrVal_742))))) (store .cse14 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base| (store (select .cse14 |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|) .cse1 v_ArrVal_744))) c_~v~0.base) c_~v~0.offset) 66) (< |v_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_#t~offset17#1_77| .cse9))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| 3)) (= (select (select |c_#memory_int| c_~v~0.base) 0) 66) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_src#1.base| |c_thread2Thread2of2ForFork1_#Ultimate.C_strcpy_dest#1.base|)) (= (select (select |c_#memory_int| |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_src#1.base|) 1) 105) (= (select .cse16 1) 105) (<= 2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_src#1.base| |c_thread2Thread1of2ForFork1_#Ultimate.C_strcpy_dest#1.base|)) (not (= c_~v~0.base 3)))))) is different from false [2023-08-04 01:26:40,156 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 [1] [2023-08-04 01:26:42,201 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 [1] [2023-08-04 01:27:15,935 WARN L233 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 124 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:27:18,556 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 [1] [2023-08-04 01:27:22,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:27:38,537 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 123 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:27:49,106 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 [1] [2023-08-04 01:27:55,751 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 [1] [2023-08-04 01:28:16,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:28:19,028 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 [1] [2023-08-04 01:28:27,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:28:31,849 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 [1] [2023-08-04 01:28:44,928 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 [1] [2023-08-04 01:28:50,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:28:57,668 INFO L124 PetriNetUnfolderBase]: 26492/39793 cut-off events. [2023-08-04 01:28:57,668 INFO L125 PetriNetUnfolderBase]: For 1349211/1349213 co-relation queries the response was YES. [2023-08-04 01:28:58,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362420 conditions, 39793 events. 26492/39793 cut-off events. For 1349211/1349213 co-relation queries the response was YES. Maximal size of possible extension queue 2065. Compared 286687 event pairs, 2793 based on Foata normal form. 229/40010 useless extension candidates. Maximal degree in co-relation 361711. Up to 24557 conditions per place. [2023-08-04 01:28:58,814 INFO L140 encePairwiseOnDemand]: 234/253 looper letters, 3158 selfloop transitions, 1507 changer transitions 102/4771 dead transitions. [2023-08-04 01:28:58,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 4771 transitions, 82167 flow [2023-08-04 01:28:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-08-04 01:28:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2023-08-04 01:28:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 7155 transitions. [2023-08-04 01:28:58,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3008577916070978 [2023-08-04 01:28:58,821 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 7155 transitions. [2023-08-04 01:28:58,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 7155 transitions. [2023-08-04 01:28:58,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:28:58,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 7155 transitions. [2023-08-04 01:28:58,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 76.11702127659575) internal successors, (7155), 94 states have internal predecessors, (7155), 0 states have call successors, (0), 0 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-04 01:28:58,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 253.0) internal successors, (24035), 95 states have internal predecessors, (24035), 0 states have call successors, (0), 0 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-04 01:28:58,842 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 253.0) internal successors, (24035), 95 states have internal predecessors, (24035), 0 states have call successors, (0), 0 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-04 01:28:58,842 INFO L175 Difference]: Start difference. First operand has 597 places, 2691 transitions, 40706 flow. Second operand 94 states and 7155 transitions. [2023-08-04 01:28:58,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 4771 transitions, 82167 flow [2023-08-04 01:29:35,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 4771 transitions, 79317 flow, removed 1404 selfloop flow, removed 5 redundant places. [2023-08-04 01:29:36,055 INFO L231 Difference]: Finished difference. Result has 726 places, 3805 transitions, 64440 flow [2023-08-04 01:29:36,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=39201, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=566, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=64440, PETRI_PLACES=726, PETRI_TRANSITIONS=3805} [2023-08-04 01:29:36,057 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 678 predicate places. [2023-08-04 01:29:36,057 INFO L495 AbstractCegarLoop]: Abstraction has has 726 places, 3805 transitions, 64440 flow [2023-08-04 01:29:36,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 71.5) internal successors, (2574), 36 states have internal predecessors, (2574), 0 states have call successors, (0), 0 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-04 01:29:36,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:29:36,058 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 01:29:36,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-04 01:29:36,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:29:36,263 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:29:36,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:29:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1356283375, now seen corresponding path program 1 times [2023-08-04 01:29:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:29:36,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760801683] [2023-08-04 01:29:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:29:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:29:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:29:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 01:29:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:29:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760801683] [2023-08-04 01:29:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760801683] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:29:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668319480] [2023-08-04 01:29:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:29:36,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:29:36,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:29:36,732 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:29:36,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-04 01:29:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:29:36,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-04 01:29:36,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:29:36,898 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 01:29:36,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-04 01:29:36,956 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 01:29:36,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-08-04 01:29:37,155 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 01:29:37,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2023-08-04 01:29:37,234 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 01:29:37,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2023-08-04 01:29:37,403 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-04 01:29:37,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-08-04 01:29:37,542 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:29:37,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2023-08-04 01:29:37,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 01:29:37,673 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 01:29:37,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2023-08-04 01:29:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:29:37,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:29:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 12 refuted. 1 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 01:29:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668319480] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:29:46,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:29:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 34 [2023-08-04 01:29:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658421510] [2023-08-04 01:29:46,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:29:46,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-04 01:29:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:29:46,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-04 01:29:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=993, Unknown=5, NotChecked=0, Total=1122 [2023-08-04 01:29:48,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 253 [2023-08-04 01:29:48,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 3805 transitions, 64440 flow. Second operand has 34 states, 34 states have (on average 70.5) internal successors, (2397), 34 states have internal predecessors, (2397), 0 states have call successors, (0), 0 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-04 01:29:48,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:29:48,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 253 [2023-08-04 01:29:48,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:30:23,579 WARN L233 SmtUtils]: Spent 24.06s on a formula simplification. DAG size of input: 111 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:31:02,901 WARN L233 SmtUtils]: Spent 29.60s on a formula simplification. DAG size of input: 96 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:31:08,629 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 [1] [2023-08-04 01:31:10,644 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 [1] [2023-08-04 01:31:12,764 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 [1] [2023-08-04 01:31:14,771 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 [1] [2023-08-04 01:31:17,174 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 [1] [2023-08-04 01:31:19,213 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 [1] [2023-08-04 01:31:29,459 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:31:33,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 01:31:43,529 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 [1] [2023-08-04 01:31:52,134 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 [1] [2023-08-04 01:31:54,146 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 [1] [2023-08-04 01:31:56,153 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 [1] [2023-08-04 01:31:58,165 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 [1] [2023-08-04 01:32:00,171 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 [1] [2023-08-04 01:32:02,723 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 [1] [2023-08-04 01:32:26,220 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:32:43,862 WARN L233 SmtUtils]: Spent 13.04s on a formula simplification. DAG size of input: 59 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:32:55,206 WARN L233 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 76 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:33:25,971 WARN L233 SmtUtils]: Spent 18.72s on a formula simplification. DAG size of input: 91 DAG size of output: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:33:28,754 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 [1] [2023-08-04 01:33:30,763 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 [1] [2023-08-04 01:33:41,223 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 [1] [2023-08-04 01:33:43,231 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 [1] [2023-08-04 01:33:45,288 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 [1] [2023-08-04 01:33:47,296 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 [1] [2023-08-04 01:33:49,308 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 [1] [2023-08-04 01:33:51,319 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 [1] [2023-08-04 01:33:53,336 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 [1] [2023-08-04 01:33:55,346 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 [1] [2023-08-04 01:33:57,377 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 [1] [2023-08-04 01:34:13,998 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 59 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 01:34:16,116 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 [1] [2023-08-04 01:34:18,123 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 [1] [2023-08-04 01:34:20,166 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 [1] [2023-08-04 01:34:22,292 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 [1] [2023-08-04 01:34:24,298 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 [1] [2023-08-04 01:34:27,412 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 [1] [2023-08-04 01:34:49,461 WARN L233 SmtUtils]: Spent 17.92s on a formula simplification. DAG size of input: 122 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-08-04 01:34:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-08-04 01:34:49,587 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 01:34:49,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-04 01:34:49,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 01:34:49,597 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-04 01:34:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-04 01:34:49,787 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. [2023-08-04 01:34:49,788 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:34:49,788 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (2/2) [2023-08-04 01:34:49,789 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 01:34:49,789 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 01:34:49,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 01:34:49 BasicIcfg [2023-08-04 01:34:49,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 01:34:49,791 INFO L158 Benchmark]: Toolchain (without parser) took 855677.64ms. Allocated memory was 499.1MB in the beginning and 4.9GB in the end (delta: 4.4GB). Free memory was 461.3MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-04 01:34:49,792 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 369.1MB. Free memory is still 323.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 01:34:49,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.09ms. Allocated memory is still 499.1MB. Free memory was 461.0MB in the beginning and 428.2MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-04 01:34:49,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.59ms. Allocated memory is still 499.1MB. Free memory was 428.2MB in the beginning and 425.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 01:34:49,792 INFO L158 Benchmark]: Boogie Preprocessor took 26.73ms. Allocated memory is still 499.1MB. Free memory was 425.7MB in the beginning and 424.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 01:34:49,792 INFO L158 Benchmark]: RCFGBuilder took 334.20ms. Allocated memory is still 499.1MB. Free memory was 424.0MB in the beginning and 464.5MB in the end (delta: -40.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.0GB. [2023-08-04 01:34:49,792 INFO L158 Benchmark]: TraceAbstraction took 854836.19ms. Allocated memory was 499.1MB in the beginning and 4.9GB in the end (delta: 4.4GB). Free memory was 463.6MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-04 01:34:49,793 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.08ms. Allocated memory is still 369.1MB. Free memory is still 323.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 426.09ms. Allocated memory is still 499.1MB. Free memory was 461.0MB in the beginning and 428.2MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.59ms. Allocated memory is still 499.1MB. Free memory was 428.2MB in the beginning and 425.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.73ms. Allocated memory is still 499.1MB. Free memory was 425.7MB in the beginning and 424.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 334.20ms. Allocated memory is still 499.1MB. Free memory was 424.0MB in the beginning and 464.5MB in the end (delta: -40.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.0GB. * TraceAbstraction took 854836.19ms. Allocated memory was 499.1MB in the beginning and 4.9GB in the end (delta: 4.4GB). Free memory was 463.6MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 274]: Unsoundness Warning unspecified type, defaulting to int C: short [274] - GenericResultAtLocation [Line: 274]: Unsoundness Warning unspecified type, defaulting to int C: short [274] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 105 PlacesBefore, 32 PlacesAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2256 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 96 TotalNumberOfCompositions, 4087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2789, independent: 2677, independent conditional: 0, independent unconditional: 2677, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1292, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2789, independent: 1417, independent conditional: 0, independent unconditional: 1417, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 1292, unknown conditional: 0, unknown unconditional: 1292] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 132 PlacesBefore, 48 PlacesAfterwards, 140 TransitionsBefore, 52 TransitionsAfterwards, 6168 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 14574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9010, independent: 8796, independent conditional: 0, independent unconditional: 8796, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3515, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9010, independent: 5329, independent conditional: 0, independent unconditional: 5329, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 3515, unknown conditional: 0, unknown unconditional: 3515] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 131 PlacesBefore, 48 PlacesAfterwards, 139 TransitionsBefore, 52 TransitionsAfterwards, 6144 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 4 ChoiceCompositions, 111 TotalNumberOfCompositions, 14582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8697, independent: 8480, independent conditional: 0, independent unconditional: 8480, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3529, independent: 3478, independent conditional: 0, independent unconditional: 3478, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8697, independent: 5002, independent conditional: 0, independent unconditional: 5002, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 3529, unknown conditional: 0, unknown unconditional: 3529] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 1107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 124 locations, 3 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: 2.3s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 147 locations, 3 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: 6.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 2 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 835 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 138/155 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 3 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: 845.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 805.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 171 mSolverCounterUnknown, 7558 SdHoareTripleChecker+Valid, 194.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7209 mSDsluCounter, 12178 SdHoareTripleChecker+Invalid, 190.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2631 IncrementalHoareTripleChecker+Unchecked, 12157 mSDsCounter, 1189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40230 IncrementalHoareTripleChecker+Invalid, 44221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1189 mSolverCounterUnsat, 21 mSDtfsCounter, 40230 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1768 GetRequests, 1002 SyntacticMatches, 26 SemanticMatches, 739 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 22269 ImplicationChecksByTransitivity, 529.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64440occurred in iteration=16, InterpolantAutomatonStates: 531, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1203 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1698 ConstructedInterpolants, 200 QuantifiedInterpolants, 20958 SizeOfPredicates, 100 NumberOfNonLiveVariables, 3750 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 44 InterpolantComputations, 5 PerfectInterpolantSequences, 441/751 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