/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_71-funloop_racing_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:51:35,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:51:35,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:51:35,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:51:35,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:51:35,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:51:35,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:51:35,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:51:35,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:51:35,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:51:35,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:51:35,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:51:35,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:51:35,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:51:35,948 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:51:35,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:51:35,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:51:35,949 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:51:35,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:51:35,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:51:35,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:51:35,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:51:35,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:51:35,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:51:35,952 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:51:35,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:51:35,952 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:51:35,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:51:35,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:51:35,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:51:35,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:35,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:51:35,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:51:35,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:51:35,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:51:35,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:51:35,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:51:35,955 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:51:35,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:51:35,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:51:35,956 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:51:35,956 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 -> PROGRAM_FIRST [2023-08-04 03:51:36,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:51:36,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:51:36,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:51:36,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:51:36,234 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:51:36,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_71-funloop_racing_bound2.i [2023-08-04 03:51:37,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:51:37,770 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:51:37,770 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_71-funloop_racing_bound2.i [2023-08-04 03:51:37,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b0d056d/4d270efc5ad3482697a438a28134b185/FLAGea336d531 [2023-08-04 03:51:37,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b0d056d/4d270efc5ad3482697a438a28134b185 [2023-08-04 03:51:37,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:51:37,809 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:51:37,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:37,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:51:37,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:51:37,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:37" (1/1) ... [2023-08-04 03:51:37,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13915f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:37, skipping insertion in model container [2023-08-04 03:51:37,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:37" (1/1) ... [2023-08-04 03:51:37,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:51:38,234 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_71-funloop_racing_bound2.i[41323,41336] [2023-08-04 03:51:38,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:38,290 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:51:38,320 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:38,322 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:38,329 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-04 03:51:38,339 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_71-funloop_racing_bound2.i[41323,41336] [2023-08-04 03:51:38,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:38,426 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:51:38,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38 WrapperNode [2023-08-04 03:51:38,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:38,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:38,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:51:38,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:51:38,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,523 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2023-08-04 03:51:38,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:38,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:51:38,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:51:38,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:51:38,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:51:38,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:51:38,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:51:38,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:51:38,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (1/1) ... [2023-08-04 03:51:38,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:38,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:38,594 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 03:51:38,597 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 03:51:38,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:51:38,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:51:38,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:51:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:51:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:51:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:51:38,625 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:51:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:51:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:51:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:51:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:51:38,628 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 03:51:38,746 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:51:38,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:51:39,063 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:51:39,070 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:51:39,070 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-04 03:51:39,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:39 BoogieIcfgContainer [2023-08-04 03:51:39,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:51:39,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:51:39,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:51:39,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:51:39,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:51:37" (1/3) ... [2023-08-04 03:51:39,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e3469b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:39, skipping insertion in model container [2023-08-04 03:51:39,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:38" (2/3) ... [2023-08-04 03:51:39,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e3469b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:39, skipping insertion in model container [2023-08-04 03:51:39,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:39" (3/3) ... [2023-08-04 03:51:39,079 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_71-funloop_racing_bound2.i [2023-08-04 03:51:39,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:51:39,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:51:39,095 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-04 03:51:39,095 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:51:39,170 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 03:51:39,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 243 transitions, 494 flow [2023-08-04 03:51:39,322 INFO L124 PetriNetUnfolderBase]: 73/375 cut-off events. [2023-08-04 03:51:39,322 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:51:39,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 375 events. 73/375 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1649 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-08-04 03:51:39,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 243 transitions, 494 flow [2023-08-04 03:51:39,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 238 transitions, 481 flow [2023-08-04 03:51:39,349 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:39,359 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 238 transitions, 481 flow [2023-08-04 03:51:39,361 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 238 transitions, 481 flow [2023-08-04 03:51:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 238 transitions, 481 flow [2023-08-04 03:51:39,418 INFO L124 PetriNetUnfolderBase]: 72/370 cut-off events. [2023-08-04 03:51:39,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:39,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 370 events. 72/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1605 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-08-04 03:51:39,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 19044 [2023-08-04 03:51:42,067 INFO L134 LiptonReduction]: Checked pairs total: 28154 [2023-08-04 03:51:42,067 INFO L136 LiptonReduction]: Total number of compositions: 181 [2023-08-04 03:51:42,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:51:42,084 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;@5af7e1ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:51:42,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 03:51:42,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:51:42,089 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2023-08-04 03:51:42,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:42,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:42,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:42,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:42,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1093547417, now seen corresponding path program 1 times [2023-08-04 03:51:42,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879802686] [2023-08-04 03:51:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:42,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:42,313 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 03:51:42,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879802686] [2023-08-04 03:51:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879802686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:42,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:51:42,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997914009] [2023-08-04 03:51:42,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:42,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:42,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 424 [2023-08-04 03:51:42,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 03:51:42,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:42,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 424 [2023-08-04 03:51:42,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:42,593 INFO L124 PetriNetUnfolderBase]: 596/1256 cut-off events. [2023-08-04 03:51:42,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:42,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 1256 events. 596/1256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7130 event pairs, 480 based on Foata normal form. 217/1239 useless extension candidates. Maximal degree in co-relation 2266. Up to 1093 conditions per place. [2023-08-04 03:51:42,602 INFO L140 encePairwiseOnDemand]: 391/424 looper letters, 52 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-04 03:51:42,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 247 flow [2023-08-04 03:51:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2023-08-04 03:51:42,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290880503144654 [2023-08-04 03:51:42,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2023-08-04 03:51:42,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2023-08-04 03:51:42,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:42,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2023-08-04 03:51:42,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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 03:51:42,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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 03:51:42,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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 03:51:42,641 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 197 flow. Second operand 3 states and 673 transitions. [2023-08-04 03:51:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 247 flow [2023-08-04 03:51:42,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:51:42,647 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 149 flow [2023-08-04 03:51:42,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2023-08-04 03:51:42,652 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-08-04 03:51:42,652 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 149 flow [2023-08-04 03:51:42,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 03:51:42,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:42,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:42,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:51:42,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:42,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1919799580, now seen corresponding path program 1 times [2023-08-04 03:51:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035622104] [2023-08-04 03:51:42,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:42,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:42,737 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 03:51:42,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035622104] [2023-08-04 03:51:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035622104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:42,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:42,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 03:51:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894918997] [2023-08-04 03:51:42,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:42,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:42,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 424 [2023-08-04 03:51:42,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 03:51:42,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:42,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 424 [2023-08-04 03:51:42,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:42,967 INFO L124 PetriNetUnfolderBase]: 563/1210 cut-off events. [2023-08-04 03:51:42,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:42,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 1210 events. 563/1210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7469 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 2288. Up to 1044 conditions per place. [2023-08-04 03:51:42,975 INFO L140 encePairwiseOnDemand]: 421/424 looper letters, 69 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-04 03:51:42,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 325 flow [2023-08-04 03:51:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2023-08-04 03:51:42,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180817610062893 [2023-08-04 03:51:42,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 659 transitions. [2023-08-04 03:51:42,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 659 transitions. [2023-08-04 03:51:42,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:42,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 659 transitions. [2023-08-04 03:51:42,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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 03:51:42,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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 03:51:42,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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 03:51:42,985 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 149 flow. Second operand 3 states and 659 transitions. [2023-08-04 03:51:42,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 325 flow [2023-08-04 03:51:42,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 321 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:42,990 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 153 flow [2023-08-04 03:51:42,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-04 03:51:42,994 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2023-08-04 03:51:42,995 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 153 flow [2023-08-04 03:51:43,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 03:51:43,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:43,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:43,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 03:51:43,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:43,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1899619685, now seen corresponding path program 1 times [2023-08-04 03:51:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:43,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057810788] [2023-08-04 03:51:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:43,095 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 03:51:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057810788] [2023-08-04 03:51:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057810788] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724764756] [2023-08-04 03:51:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:43,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:43,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:43,101 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 03:51:43,114 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 03:51:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:43,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:51:43,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:43,245 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 03:51:43,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:43,270 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 03:51:43,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724764756] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:43,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:51:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960517733] [2023-08-04 03:51:43,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:43,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:51:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:51:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:51:43,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 424 [2023-08-04 03:51:43,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states 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 03:51:43,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:43,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 424 [2023-08-04 03:51:43,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:43,511 INFO L124 PetriNetUnfolderBase]: 593/1232 cut-off events. [2023-08-04 03:51:43,511 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-04 03:51:43,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1232 events. 593/1232 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6946 event pairs, 480 based on Foata normal form. 3/1026 useless extension candidates. Maximal degree in co-relation 2334. Up to 1062 conditions per place. [2023-08-04 03:51:43,519 INFO L140 encePairwiseOnDemand]: 421/424 looper letters, 52 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-08-04 03:51:43,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 279 flow [2023-08-04 03:51:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1230 transitions. [2023-08-04 03:51:43,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834905660377358 [2023-08-04 03:51:43,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1230 transitions. [2023-08-04 03:51:43,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1230 transitions. [2023-08-04 03:51:43,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:43,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1230 transitions. [2023-08-04 03:51:43,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 03:51:43,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states 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 03:51:43,531 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states 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 03:51:43,531 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 153 flow. Second operand 6 states and 1230 transitions. [2023-08-04 03:51:43,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 279 flow [2023-08-04 03:51:43,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:51:43,533 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 185 flow [2023-08-04 03:51:43,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-08-04 03:51:43,534 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2023-08-04 03:51:43,534 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 185 flow [2023-08-04 03:51:43,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states 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 03:51:43,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:43,536 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:43,549 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 03:51:43,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:43,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:43,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1327426864, now seen corresponding path program 2 times [2023-08-04 03:51:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:43,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807493871] [2023-08-04 03:51:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:51:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:43,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807493871] [2023-08-04 03:51:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807493871] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591605940] [2023-08-04 03:51:43,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:51:43,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:43,875 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 03:51:43,893 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 03:51:43,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:51:43,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:51:43,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:51:43,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:43,983 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 7 treesize of output 6 [2023-08-04 03:51:44,052 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:44,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:51:44,078 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 13 treesize of output 15 [2023-08-04 03:51:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:51:44,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:44,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591605940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:44,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:44,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:51:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878930667] [2023-08-04 03:51:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:44,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:51:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:51:44,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:51:44,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 424 [2023-08-04 03:51:44,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 186.5) internal successors, (1119), 6 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states 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 03:51:44,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:44,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 424 [2023-08-04 03:51:44,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:44,648 INFO L124 PetriNetUnfolderBase]: 855/1794 cut-off events. [2023-08-04 03:51:44,649 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-04 03:51:44,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3474 conditions, 1794 events. 855/1794 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 10884 event pairs, 108 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 3439. Up to 1062 conditions per place. [2023-08-04 03:51:44,658 INFO L140 encePairwiseOnDemand]: 415/424 looper letters, 117 selfloop transitions, 12 changer transitions 2/144 dead transitions. [2023-08-04 03:51:44,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 144 transitions, 601 flow [2023-08-04 03:51:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1241 transitions. [2023-08-04 03:51:44,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487814465408805 [2023-08-04 03:51:44,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1241 transitions. [2023-08-04 03:51:44,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1241 transitions. [2023-08-04 03:51:44,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:44,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1241 transitions. [2023-08-04 03:51:44,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.83333333333334) internal successors, (1241), 6 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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 03:51:44,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states 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 03:51:44,675 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states 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 03:51:44,675 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 185 flow. Second operand 6 states and 1241 transitions. [2023-08-04 03:51:44,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 144 transitions, 601 flow [2023-08-04 03:51:44,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 144 transitions, 587 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:44,682 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 252 flow [2023-08-04 03:51:44,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2023-08-04 03:51:44,684 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2023-08-04 03:51:44,684 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 252 flow [2023-08-04 03:51:44,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.5) internal successors, (1119), 6 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states 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 03:51:44,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:44,685 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:44,694 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 03:51:44,893 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 03:51:44,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:44,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1046442792, now seen corresponding path program 1 times [2023-08-04 03:51:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153627901] [2023-08-04 03:51:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:51:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153627901] [2023-08-04 03:51:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153627901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142164522] [2023-08-04 03:51:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:44,957 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 03:51:44,959 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 03:51:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:45,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:51:45,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:51:45,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:51:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142164522] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:45,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:51:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003569725] [2023-08-04 03:51:45,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:45,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:51:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:51:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:51:45,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 424 [2023-08-04 03:51:45,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 252 flow. Second operand has 14 states, 14 states have (on average 192.92857142857142) internal successors, (2701), 14 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states 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 03:51:45,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:45,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 424 [2023-08-04 03:51:45,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:45,282 INFO L124 PetriNetUnfolderBase]: 61/186 cut-off events. [2023-08-04 03:51:45,282 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-08-04 03:51:45,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 186 events. 61/186 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 640 event pairs, 1 based on Foata normal form. 33/213 useless extension candidates. Maximal degree in co-relation 434. Up to 111 conditions per place. [2023-08-04 03:51:45,283 INFO L140 encePairwiseOnDemand]: 419/424 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-08-04 03:51:45,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 316 flow [2023-08-04 03:51:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:51:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:51:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2730 transitions. [2023-08-04 03:51:45,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45990566037735847 [2023-08-04 03:51:45,290 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2730 transitions. [2023-08-04 03:51:45,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2730 transitions. [2023-08-04 03:51:45,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:45,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2730 transitions. [2023-08-04 03:51:45,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states 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 03:51:45,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 424.0) internal successors, (6360), 15 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states 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 03:51:45,308 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 424.0) internal successors, (6360), 15 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states 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 03:51:45,308 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 252 flow. Second operand 14 states and 2730 transitions. [2023-08-04 03:51:45,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 316 flow [2023-08-04 03:51:45,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-04 03:51:45,313 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 171 flow [2023-08-04 03:51:45,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-04 03:51:45,315 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-08-04 03:51:45,315 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 171 flow [2023-08-04 03:51:45,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 192.92857142857142) internal successors, (2701), 14 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states 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 03:51:45,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:45,317 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:45,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:51:45,522 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 03:51:45,522 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:45,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash -586709385, now seen corresponding path program 1 times [2023-08-04 03:51:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:45,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61600838] [2023-08-04 03:51:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:51:46,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:46,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61600838] [2023-08-04 03:51:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61600838] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:46,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434667181] [2023-08-04 03:51:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:46,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:46,124 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 03:51:46,135 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 03:51:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 03:51:46,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:46,243 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 7 treesize of output 6 [2023-08-04 03:51:46,306 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:46,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:51:46,326 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 13 treesize of output 15 [2023-08-04 03:51:46,407 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 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-04 03:51:46,463 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 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-04 03:51:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:51:46,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:54,665 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_196 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_196) |c_~#cache~0.base|))) is different from false [2023-08-04 03:51:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:51:54,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434667181] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:54,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:54,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-04 03:51:54,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423584205] [2023-08-04 03:51:54,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:54,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 03:51:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 03:51:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=341, Unknown=3, NotChecked=38, Total=462 [2023-08-04 03:51:55,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 424 [2023-08-04 03:51:55,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 171 flow. Second operand has 22 states, 22 states have (on average 150.54545454545453) internal successors, (3312), 22 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states 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 03:51:55,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:55,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 424 [2023-08-04 03:51:55,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:57,490 INFO L124 PetriNetUnfolderBase]: 55/178 cut-off events. [2023-08-04 03:51:57,490 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-04 03:51:57,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 178 events. 55/178 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 480 event pairs, 2 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 370. Up to 38 conditions per place. [2023-08-04 03:51:57,491 INFO L140 encePairwiseOnDemand]: 413/424 looper letters, 54 selfloop transitions, 17 changer transitions 2/77 dead transitions. [2023-08-04 03:51:57,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 417 flow [2023-08-04 03:51:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:51:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:51:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1840 transitions. [2023-08-04 03:51:57,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36163522012578614 [2023-08-04 03:51:57,497 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1840 transitions. [2023-08-04 03:51:57,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1840 transitions. [2023-08-04 03:51:57,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:57,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1840 transitions. [2023-08-04 03:51:57,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 153.33333333333334) internal successors, (1840), 12 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states 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 03:51:57,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 424.0) internal successors, (5512), 13 states have internal predecessors, (5512), 0 states have call successors, (0), 0 states 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 03:51:57,512 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 424.0) internal successors, (5512), 13 states have internal predecessors, (5512), 0 states have call successors, (0), 0 states 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 03:51:57,513 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 171 flow. Second operand 12 states and 1840 transitions. [2023-08-04 03:51:57,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 417 flow [2023-08-04 03:51:57,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 342 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-04 03:51:57,516 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 211 flow [2023-08-04 03:51:57,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-08-04 03:51:57,517 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2023-08-04 03:51:57,518 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 211 flow [2023-08-04 03:51:57,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 150.54545454545453) internal successors, (3312), 22 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states 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 03:51:57,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:57,519 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:57,528 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 03:51:57,728 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 03:51:57,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:51:57,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash -431194824, now seen corresponding path program 1 times [2023-08-04 03:51:57,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:57,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516573560] [2023-08-04 03:51:57,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:57,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:51:58,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516573560] [2023-08-04 03:51:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516573560] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105961633] [2023-08-04 03:51:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:58,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:58,273 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 03:51:58,281 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 03:51:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:51:58,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:58,399 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 7 treesize of output 6 [2023-08-04 03:51:58,457 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:58,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:51:58,465 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 13 treesize of output 15 [2023-08-04 03:51:58,567 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:51:58,627 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 16 treesize of output 18 [2023-08-04 03:51:58,670 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 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-04 03:52:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:52:01,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:09,536 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:52:11,561 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_300 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_300)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:52:11,581 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_300 Int) (v_ArrVal_299 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_299))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_300))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:52:11,609 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_300 Int) (v_ArrVal_297 Int) (v_ArrVal_299 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_297)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_299))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_300))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:52:11,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_300 Int) (v_ArrVal_297 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_299 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_297)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_299) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_300) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-08-04 03:52:11,683 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_300 Int) (v_ArrVal_297 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_296))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_297))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_299) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_300) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-08-04 03:52:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-04 03:52:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105961633] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:11,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 21 [2023-08-04 03:52:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155376068] [2023-08-04 03:52:11,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:11,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 03:52:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 03:52:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=206, Unknown=12, NotChecked=210, Total=506 [2023-08-04 03:52:12,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:13,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:14,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:18,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:22,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:23,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:24,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:25,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:26,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:28,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:29,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:30,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:31,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:32,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:33,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:34,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:36,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:37,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:38,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:39,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:40,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:41,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:42,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:43,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:44,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:45,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:46,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:46,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 424 [2023-08-04 03:52:46,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 211 flow. Second operand has 23 states, 23 states have (on average 154.47826086956522) internal successors, (3553), 23 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states 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 03:52:46,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:46,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 424 [2023-08-04 03:52:46,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:48,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:49,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:51,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:54,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:52:57,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:03,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:04,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:05,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:06,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:07,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:09,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:10,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:17,771 INFO L124 PetriNetUnfolderBase]: 107/368 cut-off events. [2023-08-04 03:53:17,771 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2023-08-04 03:53:17,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 368 events. 107/368 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1390 event pairs, 3 based on Foata normal form. 1/355 useless extension candidates. Maximal degree in co-relation 958. Up to 94 conditions per place. [2023-08-04 03:53:17,773 INFO L140 encePairwiseOnDemand]: 415/424 looper letters, 98 selfloop transitions, 19 changer transitions 0/121 dead transitions. [2023-08-04 03:53:17,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 121 transitions, 733 flow [2023-08-04 03:53:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 03:53:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 03:53:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1752 transitions. [2023-08-04 03:53:17,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37564322469982847 [2023-08-04 03:53:17,779 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1752 transitions. [2023-08-04 03:53:17,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1752 transitions. [2023-08-04 03:53:17,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:17,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1752 transitions. [2023-08-04 03:53:17,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 159.27272727272728) internal successors, (1752), 11 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states 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 03:53:17,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 424.0) internal successors, (5088), 12 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states 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 03:53:17,790 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 424.0) internal successors, (5088), 12 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states 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 03:53:17,790 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 211 flow. Second operand 11 states and 1752 transitions. [2023-08-04 03:53:17,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 121 transitions, 733 flow [2023-08-04 03:53:17,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 121 transitions, 718 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-04 03:53:17,795 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 375 flow [2023-08-04 03:53:17,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=375, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2023-08-04 03:53:17,796 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2023-08-04 03:53:17,796 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 375 flow [2023-08-04 03:53:17,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.47826086956522) internal successors, (3553), 23 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states 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 03:53:17,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:17,811 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:17,817 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 03:53:18,017 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 03:53:18,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:53:18,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2107296104, now seen corresponding path program 2 times [2023-08-04 03:53:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584123194] [2023-08-04 03:53:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:53:18,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:18,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584123194] [2023-08-04 03:53:18,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584123194] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:18,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556408740] [2023-08-04 03:53:18,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:53:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:18,507 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 03:53:18,509 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 03:53:18,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:53:18,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:53:18,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:53:18,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:18,639 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 7 treesize of output 6 [2023-08-04 03:53:18,694 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:18,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:53:18,712 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 13 treesize of output 15 [2023-08-04 03:53:18,807 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:53:18,872 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 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-04 03:53:21,137 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 16 treesize of output 18 [2023-08-04 03:53:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:53:21,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:21,212 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_402) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:53:23,175 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_402) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:53:25,198 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_402) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:53:25,260 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_400)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_402) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-08-04 03:53:25,285 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_397 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_400))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_402) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2023-08-04 03:53:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-04 03:53:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556408740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:25,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:25,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-08-04 03:53:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104099891] [2023-08-04 03:53:25,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:25,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 03:53:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 03:53:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=236, Unknown=13, NotChecked=180, Total=506 [2023-08-04 03:53:25,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 424 [2023-08-04 03:53:25,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 375 flow. Second operand has 23 states, 23 states have (on average 154.7391304347826) internal successors, (3559), 23 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states 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 03:53:25,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:53:25,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 424 [2023-08-04 03:53:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:26,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:28,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:31,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:32,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:34,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:36,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:37,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:38,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:39,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:40,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:41,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:42,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:53:50,646 INFO L124 PetriNetUnfolderBase]: 108/381 cut-off events. [2023-08-04 03:53:50,646 INFO L125 PetriNetUnfolderBase]: For 624/628 co-relation queries the response was YES. [2023-08-04 03:53:50,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 381 events. 108/381 cut-off events. For 624/628 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1463 event pairs, 7 based on Foata normal form. 5/371 useless extension candidates. Maximal degree in co-relation 1248. Up to 87 conditions per place. [2023-08-04 03:53:50,648 INFO L140 encePairwiseOnDemand]: 415/424 looper letters, 95 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2023-08-04 03:53:50,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 122 transitions, 898 flow [2023-08-04 03:53:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 03:53:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 03:53:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1752 transitions. [2023-08-04 03:53:50,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37564322469982847 [2023-08-04 03:53:50,653 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1752 transitions. [2023-08-04 03:53:50,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1752 transitions. [2023-08-04 03:53:50,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:50,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1752 transitions. [2023-08-04 03:53:50,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 159.27272727272728) internal successors, (1752), 11 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states 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 03:53:50,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 424.0) internal successors, (5088), 12 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states 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 03:53:50,663 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 424.0) internal successors, (5088), 12 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states 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 03:53:50,663 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 375 flow. Second operand 11 states and 1752 transitions. [2023-08-04 03:53:50,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 122 transitions, 898 flow [2023-08-04 03:53:50,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 122 transitions, 886 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-04 03:53:50,668 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 512 flow [2023-08-04 03:53:50,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2023-08-04 03:53:50,669 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 24 predicate places. [2023-08-04 03:53:50,669 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 512 flow [2023-08-04 03:53:50,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.7391304347826) internal successors, (3559), 23 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states 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 03:53:50,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:50,670 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 03:53:50,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:50,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:53:50,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash -707973369, now seen corresponding path program 3 times [2023-08-04 03:53:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:50,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694607394] [2023-08-04 03:53:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:53:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694607394] [2023-08-04 03:53:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694607394] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154261356] [2023-08-04 03:53:51,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:53:51,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:51,945 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 03:53:51,953 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 03:53:52,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:53:52,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:53:52,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-04 03:53:52,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:52,093 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 7 treesize of output 6 [2023-08-04 03:53:52,154 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:52,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:53:52,162 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 13 treesize of output 15 [2023-08-04 03:53:52,267 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 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-04 03:53:52,314 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 21 treesize of output 23 [2023-08-04 03:53:52,371 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 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-04 03:53:52,478 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 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-04 03:53:52,536 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 0 case distinctions, treesize of input 27 treesize of output 22 [2023-08-04 03:54:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:54:01,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:54:15,913 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:54:17,932 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_538 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_538)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-04 03:54:32,173 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_538 Int)) (or (= 0 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_538) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| 28)))) is different from false [2023-08-04 03:54:34,198 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_538 Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_538) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| 28)))) is different from false [2023-08-04 03:54:35,218 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_538 Int) (v_ArrVal_533 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_533))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_538) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-04 03:54:35,245 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_538 Int) (v_ArrVal_533 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_533))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_538) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-04 03:54:35,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_538 Int) (v_ArrVal_533 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_533))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_538) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-04 03:54:53,438 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_538 Int) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (store (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_530))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_533) |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_538) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-04 03:54:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 15 not checked. [2023-08-04 03:54:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154261356] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:54:53,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:54:53,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2023-08-04 03:54:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535092011] [2023-08-04 03:54:53,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:54:53,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-04 03:54:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:54:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-04 03:54:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=547, Unknown=41, NotChecked=456, Total=1190 [2023-08-04 03:54:53,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 424 [2023-08-04 03:54:53,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 512 flow. Second operand has 35 states, 35 states have (on average 150.57142857142858) internal successors, (5270), 35 states have internal predecessors, (5270), 0 states have call successors, (0), 0 states 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 03:54:53,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:54:53,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 424 [2023-08-04 03:54:53,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:54:54,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:54:55,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:54:57,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:01,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:02,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:04,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:05,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:06,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:07,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:11,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:12,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:16,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:17,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:18,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:19,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:21,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:22,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:23,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:24,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:25,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:26,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:32,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:34,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:40,177 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 66 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:55:41,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:42,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:46,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:10,210 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 65 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:56:11,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:12,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:16,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:17,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:18,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:19,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:32,586 WARN L233 SmtUtils]: Spent 8.83s on a formula simplification. DAG size of input: 82 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:56:33,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:35,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:37,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:04,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:14,726 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 79 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:57:15,864 INFO L124 PetriNetUnfolderBase]: 112/402 cut-off events. [2023-08-04 03:57:15,865 INFO L125 PetriNetUnfolderBase]: For 965/965 co-relation queries the response was YES. [2023-08-04 03:57:15,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 402 events. 112/402 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1593 event pairs, 13 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 1408. Up to 112 conditions per place. [2023-08-04 03:57:15,867 INFO L140 encePairwiseOnDemand]: 413/424 looper letters, 0 selfloop transitions, 0 changer transitions 110/110 dead transitions. [2023-08-04 03:57:15,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 915 flow [2023-08-04 03:57:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-04 03:57:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-04 03:57:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2433 transitions. [2023-08-04 03:57:15,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35863797169811323 [2023-08-04 03:57:15,874 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2433 transitions. [2023-08-04 03:57:15,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2433 transitions. [2023-08-04 03:57:15,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:15,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2433 transitions. [2023-08-04 03:57:15,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 152.0625) internal successors, (2433), 16 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states 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 03:57:15,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 424.0) internal successors, (7208), 17 states have internal predecessors, (7208), 0 states have call successors, (0), 0 states 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 03:57:15,890 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 424.0) internal successors, (7208), 17 states have internal predecessors, (7208), 0 states have call successors, (0), 0 states 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 03:57:15,890 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 512 flow. Second operand 16 states and 2433 transitions. [2023-08-04 03:57:15,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 915 flow [2023-08-04 03:57:15,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 110 transitions, 884 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-04 03:57:15,896 INFO L231 Difference]: Finished difference. Result has 94 places, 0 transitions, 0 flow [2023-08-04 03:57:15,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=94, PETRI_TRANSITIONS=0} [2023-08-04 03:57:15,897 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 31 predicate places. [2023-08-04 03:57:15,897 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 0 transitions, 0 flow [2023-08-04 03:57:15,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 150.57142857142858) internal successors, (5270), 35 states have internal predecessors, (5270), 0 states have call successors, (0), 0 states 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 03:57:15,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 03:57:15,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 03:57:15,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 03:57:15,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 03:57:15,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 03:57:16,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:16,107 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-08-04 03:57:16,110 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 03:57:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 243 transitions, 494 flow [2023-08-04 03:57:16,139 INFO L124 PetriNetUnfolderBase]: 73/375 cut-off events. [2023-08-04 03:57:16,139 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:57:16,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 375 events. 73/375 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1649 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-08-04 03:57:16,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 243 transitions, 494 flow [2023-08-04 03:57:16,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 238 transitions, 481 flow [2023-08-04 03:57:16,143 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:57:16,143 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 238 transitions, 481 flow [2023-08-04 03:57:16,143 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 238 transitions, 481 flow [2023-08-04 03:57:16,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 238 transitions, 481 flow [2023-08-04 03:57:16,162 INFO L124 PetriNetUnfolderBase]: 72/370 cut-off events. [2023-08-04 03:57:16,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:57:16,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 370 events. 72/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1605 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-08-04 03:57:16,171 INFO L119 LiptonReduction]: Number of co-enabled transitions 19044 [2023-08-04 03:57:18,596 INFO L134 LiptonReduction]: Checked pairs total: 30988 [2023-08-04 03:57:18,597 INFO L136 LiptonReduction]: Total number of compositions: 179 [2023-08-04 03:57:18,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:57:18,598 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;@5af7e1ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:57:18,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:57:18,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:57:18,602 INFO L124 PetriNetUnfolderBase]: 16/54 cut-off events. [2023-08-04 03:57:18,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:57:18,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:18,602 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 03:57:18,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:57:18,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash -86544663, now seen corresponding path program 1 times [2023-08-04 03:57:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288873955] [2023-08-04 03:57:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:18,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:18,619 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 03:57:18,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:18,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288873955] [2023-08-04 03:57:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288873955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:57:18,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:57:18,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:57:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842259553] [2023-08-04 03:57:18,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:57:18,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:57:18,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:57:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:57:18,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 422 [2023-08-04 03:57:18,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 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 03:57:18,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:18,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 422 [2023-08-04 03:57:18,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:18,759 INFO L124 PetriNetUnfolderBase]: 596/1254 cut-off events. [2023-08-04 03:57:18,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:57:18,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1254 events. 596/1254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7154 event pairs, 480 based on Foata normal form. 216/1231 useless extension candidates. Maximal degree in co-relation 2264. Up to 1093 conditions per place. [2023-08-04 03:57:18,762 INFO L140 encePairwiseOnDemand]: 388/422 looper letters, 22 selfloop transitions, 2 changer transitions 38/67 dead transitions. [2023-08-04 03:57:18,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 247 flow [2023-08-04 03:57:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:57:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:57:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2023-08-04 03:57:18,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323854660347551 [2023-08-04 03:57:18,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2023-08-04 03:57:18,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2023-08-04 03:57:18,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:18,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2023-08-04 03:57:18,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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 03:57:18,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 422.0) internal successors, (1688), 4 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states 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 03:57:18,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 422.0) internal successors, (1688), 4 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states 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 03:57:18,769 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 674 transitions. [2023-08-04 03:57:18,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 247 flow [2023-08-04 03:57:18,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:57:18,770 INFO L231 Difference]: Finished difference. Result has 66 places, 29 transitions, 73 flow [2023-08-04 03:57:18,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=66, PETRI_TRANSITIONS=29} [2023-08-04 03:57:18,771 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-08-04 03:57:18,771 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 29 transitions, 73 flow [2023-08-04 03:57:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 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 03:57:18,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:18,772 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:18,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 03:57:18,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:57:18,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 327184901, now seen corresponding path program 1 times [2023-08-04 03:57:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770898408] [2023-08-04 03:57:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:18,826 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 03:57:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770898408] [2023-08-04 03:57:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770898408] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192817099] [2023-08-04 03:57:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:18,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:18,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:18,829 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 03:57:18,833 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 03:57:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:18,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:57:18,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:18,918 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 03:57:18,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:18,934 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 03:57:18,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192817099] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:18,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:18,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:57:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898490344] [2023-08-04 03:57:18,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:18,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:57:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:57:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:57:18,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 422 [2023-08-04 03:57:18,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 29 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 196.57142857142858) internal successors, (1376), 7 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states 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 03:57:18,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:18,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 422 [2023-08-04 03:57:18,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:19,010 INFO L124 PetriNetUnfolderBase]: 54/139 cut-off events. [2023-08-04 03:57:19,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:57:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 139 events. 54/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 377 event pairs, 45 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 265. Up to 119 conditions per place. [2023-08-04 03:57:19,011 INFO L140 encePairwiseOnDemand]: 419/422 looper letters, 22 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-08-04 03:57:19,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 139 flow [2023-08-04 03:57:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:57:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:57:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1200 transitions. [2023-08-04 03:57:19,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47393364928909953 [2023-08-04 03:57:19,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1200 transitions. [2023-08-04 03:57:19,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1200 transitions. [2023-08-04 03:57:19,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:19,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1200 transitions. [2023-08-04 03:57:19,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states 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 03:57:19,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states 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 03:57:19,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states 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 03:57:19,021 INFO L175 Difference]: Start difference. First operand has 66 places, 29 transitions, 73 flow. Second operand 6 states and 1200 transitions. [2023-08-04 03:57:19,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 139 flow [2023-08-04 03:57:19,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 135 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:57:19,022 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-08-04 03:57:19,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-08-04 03:57:19,023 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-08-04 03:57:19,023 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-08-04 03:57:19,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.57142857142858) internal successors, (1376), 7 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states 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 03:57:19,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:19,024 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-04 03:57:19,031 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 03:57:19,228 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 03:57:19,229 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:57:19,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:19,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1586320873, now seen corresponding path program 2 times [2023-08-04 03:57:19,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:19,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919428103] [2023-08-04 03:57:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:19,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:57:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919428103] [2023-08-04 03:57:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919428103] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095096075] [2023-08-04 03:57:19,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:57:19,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:19,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:19,290 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 03:57:19,319 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 03:57:19,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:57:19,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:57:19,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:57:19,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:57:19,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:57:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095096075] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:19,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:19,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:57:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549514927] [2023-08-04 03:57:19,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:19,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:57:19,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:19,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:57:19,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:57:19,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 422 [2023-08-04 03:57:19,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 105 flow. Second operand has 13 states, 13 states have (on average 196.30769230769232) internal successors, (2552), 13 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states 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 03:57:19,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:19,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 422 [2023-08-04 03:57:19,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:19,547 INFO L124 PetriNetUnfolderBase]: 54/145 cut-off events. [2023-08-04 03:57:19,547 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 03:57:19,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 145 events. 54/145 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 373 event pairs, 45 based on Foata normal form. 6/122 useless extension candidates. Maximal degree in co-relation 256. Up to 119 conditions per place. [2023-08-04 03:57:19,548 INFO L140 encePairwiseOnDemand]: 419/422 looper letters, 22 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-04 03:57:19,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 207 flow [2023-08-04 03:57:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:57:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:57:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2379 transitions. [2023-08-04 03:57:19,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697867298578199 [2023-08-04 03:57:19,553 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2379 transitions. [2023-08-04 03:57:19,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2379 transitions. [2023-08-04 03:57:19,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:19,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2379 transitions. [2023-08-04 03:57:19,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 198.25) internal successors, (2379), 12 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states 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 03:57:19,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 422.0) internal successors, (5486), 13 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states 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 03:57:19,566 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 422.0) internal successors, (5486), 13 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states 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 03:57:19,566 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 2379 transitions. [2023-08-04 03:57:19,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 207 flow [2023-08-04 03:57:19,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 193 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:57:19,567 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-08-04 03:57:19,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-04 03:57:19,567 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-08-04 03:57:19,568 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-08-04 03:57:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 196.30769230769232) internal successors, (2552), 13 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states 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 03:57:19,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:19,568 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-04 03:57:19,579 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 03:57:19,773 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 03:57:19,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:57:19,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 624730217, now seen corresponding path program 3 times [2023-08-04 03:57:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552529953] [2023-08-04 03:57:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:57:19,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:57:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:57:19,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:57:19,840 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:57:19,841 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:57:19,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 03:57:19,841 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-04 03:57:19,841 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:57:19,842 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:57:19,842 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:57:19,877 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 03:57:19,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 314 transitions, 646 flow [2023-08-04 03:57:19,928 INFO L124 PetriNetUnfolderBase]: 118/602 cut-off events. [2023-08-04 03:57:19,928 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 03:57:19,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 602 events. 118/602 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3046 event pairs, 0 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 377. Up to 12 conditions per place. [2023-08-04 03:57:19,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 314 transitions, 646 flow [2023-08-04 03:57:19,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 314 transitions, 646 flow [2023-08-04 03:57:19,939 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:57:19,939 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 314 transitions, 646 flow [2023-08-04 03:57:19,939 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 314 transitions, 646 flow [2023-08-04 03:57:19,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 314 transitions, 646 flow [2023-08-04 03:57:19,985 INFO L124 PetriNetUnfolderBase]: 118/602 cut-off events. [2023-08-04 03:57:19,985 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 03:57:19,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 602 events. 118/602 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3046 event pairs, 0 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 377. Up to 12 conditions per place. [2023-08-04 03:57:20,014 INFO L119 LiptonReduction]: Number of co-enabled transitions 49128 [2023-08-04 03:57:23,001 INFO L134 LiptonReduction]: Checked pairs total: 85335 [2023-08-04 03:57:23,002 INFO L136 LiptonReduction]: Total number of compositions: 240 [2023-08-04 03:57:23,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:57:23,003 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;@5af7e1ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:57:23,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-04 03:57:23,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:57:23,006 INFO L124 PetriNetUnfolderBase]: 15/42 cut-off events. [2023-08-04 03:57:23,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:57:23,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:23,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:23,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:57:23,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 541662292, now seen corresponding path program 1 times [2023-08-04 03:57:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25746450] [2023-08-04 03:57:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:23,025 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 03:57:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25746450] [2023-08-04 03:57:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25746450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:57:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:57:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:57:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859622336] [2023-08-04 03:57:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:57:23,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:57:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:57:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:57:23,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 554 [2023-08-04 03:57:23,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 134 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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 03:57:23,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:23,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 554 [2023-08-04 03:57:23,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:24,742 INFO L124 PetriNetUnfolderBase]: 19933/30665 cut-off events. [2023-08-04 03:57:24,743 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-04 03:57:24,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58992 conditions, 30665 events. 19933/30665 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 212679 event pairs, 17166 based on Foata normal form. 5463/30480 useless extension candidates. Maximal degree in co-relation 20163. Up to 28224 conditions per place. [2023-08-04 03:57:24,897 INFO L140 encePairwiseOnDemand]: 509/554 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-04 03:57:24,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 354 flow [2023-08-04 03:57:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:57:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:57:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2023-08-04 03:57:24,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258724428399518 [2023-08-04 03:57:24,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 874 transitions. [2023-08-04 03:57:24,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 874 transitions. [2023-08-04 03:57:24,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:24,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 874 transitions. [2023-08-04 03:57:24,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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 03:57:24,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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 03:57:24,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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 03:57:24,904 INFO L175 Difference]: Start difference. First operand has 87 places, 134 transitions, 286 flow. Second operand 3 states and 874 transitions. [2023-08-04 03:57:24,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 354 flow [2023-08-04 03:57:24,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:57:24,908 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 214 flow [2023-08-04 03:57:24,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2023-08-04 03:57:24,909 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2023-08-04 03:57:24,909 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 214 flow [2023-08-04 03:57:24,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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 03:57:24,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:24,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:24,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 03:57:24,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:57:24,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1847258826, now seen corresponding path program 1 times [2023-08-04 03:57:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714459811] [2023-08-04 03:57:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:24,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:24,936 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 03:57:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714459811] [2023-08-04 03:57:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714459811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683441660] [2023-08-04 03:57:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:24,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:24,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:24,939 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 03:57:24,965 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 03:57:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:25,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:57:25,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:25,041 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 03:57:25,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:57:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683441660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:57:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:57:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:57:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281051426] [2023-08-04 03:57:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:57:25,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:57:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:57:25,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:57:25,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 554 [2023-08-04 03:57:25,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 03:57:25,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:25,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 554 [2023-08-04 03:57:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:26,714 INFO L124 PetriNetUnfolderBase]: 19612/30394 cut-off events. [2023-08-04 03:57:26,715 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-04 03:57:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58717 conditions, 30394 events. 19612/30394 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 215035 event pairs, 8256 based on Foata normal form. 0/24769 useless extension candidates. Maximal degree in co-relation 58704. Up to 28177 conditions per place. [2023-08-04 03:57:26,907 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 91 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-08-04 03:57:26,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 436 flow [2023-08-04 03:57:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:57:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:57:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-04 03:57:26,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108303249097473 [2023-08-04 03:57:26,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-04 03:57:26,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-04 03:57:26,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:26,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-04 03:57:26,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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 03:57:26,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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 03:57:26,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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 03:57:26,953 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 214 flow. Second operand 3 states and 849 transitions. [2023-08-04 03:57:26,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 436 flow [2023-08-04 03:57:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 432 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:57:26,956 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 222 flow [2023-08-04 03:57:26,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-08-04 03:57:26,957 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-08-04 03:57:26,957 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 222 flow [2023-08-04 03:57:26,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 03:57:26,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:26,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:26,968 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 03:57:27,162 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,SelfDestructingSolverStorable14 [2023-08-04 03:57:27,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:57:27,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:27,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1224295752, now seen corresponding path program 1 times [2023-08-04 03:57:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724100991] [2023-08-04 03:57:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:27,199 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 03:57:27,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:27,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724100991] [2023-08-04 03:57:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724100991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:27,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206344854] [2023-08-04 03:57:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:27,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:27,201 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 03:57:27,203 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 03:57:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:27,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:57:27,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:27,338 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 03:57:27,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:27,352 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 03:57:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206344854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:27,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:57:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675951178] [2023-08-04 03:57:27,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:27,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:57:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:57:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:57:27,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 554 [2023-08-04 03:57:27,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 253.14285714285714) internal successors, (1772), 7 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states 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 03:57:27,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:27,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 554 [2023-08-04 03:57:27,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:29,041 INFO L124 PetriNetUnfolderBase]: 20049/30702 cut-off events. [2023-08-04 03:57:29,041 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2023-08-04 03:57:29,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59605 conditions, 30702 events. 20049/30702 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 211204 event pairs, 17166 based on Foata normal form. 3/25281 useless extension candidates. Maximal degree in co-relation 59577. Up to 28195 conditions per place. [2023-08-04 03:57:29,174 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-04 03:57:29,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 392 flow [2023-08-04 03:57:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:57:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:57:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1587 transitions. [2023-08-04 03:57:29,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47743682310469315 [2023-08-04 03:57:29,176 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1587 transitions. [2023-08-04 03:57:29,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1587 transitions. [2023-08-04 03:57:29,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:29,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1587 transitions. [2023-08-04 03:57:29,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 264.5) internal successors, (1587), 6 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states 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 03:57:29,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 03:57:29,183 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 03:57:29,183 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 222 flow. Second operand 6 states and 1587 transitions. [2023-08-04 03:57:29,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 392 flow [2023-08-04 03:57:29,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:57:29,185 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 256 flow [2023-08-04 03:57:29,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-04 03:57:29,186 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2023-08-04 03:57:29,186 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 256 flow [2023-08-04 03:57:29,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.14285714285714) internal successors, (1772), 7 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states 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 03:57:29,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:29,186 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:29,197 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 03:57:29,391 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,SelfDestructingSolverStorable15 [2023-08-04 03:57:29,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:57:29,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -95070875, now seen corresponding path program 2 times [2023-08-04 03:57:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31953775] [2023-08-04 03:57:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:57:29,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31953775] [2023-08-04 03:57:29,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31953775] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677173461] [2023-08-04 03:57:29,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:57:29,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:29,457 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 03:57:29,468 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 03:57:29,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:57:29,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:57:29,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:57:29,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:29,574 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 7 treesize of output 6 [2023-08-04 03:57:29,615 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:29,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:57:29,637 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 13 treesize of output 15 [2023-08-04 03:57:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:57:29,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:57:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677173461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:57:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:57:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:57:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226569854] [2023-08-04 03:57:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:57:29,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:57:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:57:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:57:29,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 554 [2023-08-04 03:57:29,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 240.66666666666666) internal successors, (1444), 6 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states 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 03:57:29,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:29,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 554 [2023-08-04 03:57:29,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:32,456 INFO L124 PetriNetUnfolderBase]: 25720/40339 cut-off events. [2023-08-04 03:57:32,457 INFO L125 PetriNetUnfolderBase]: For 1006/1006 co-relation queries the response was YES. [2023-08-04 03:57:32,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78774 conditions, 40339 events. 25720/40339 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 301766 event pairs, 3900 based on Foata normal form. 0/33185 useless extension candidates. Maximal degree in co-relation 78738. Up to 27951 conditions per place. [2023-08-04 03:57:32,740 INFO L140 encePairwiseOnDemand]: 544/554 looper letters, 195 selfloop transitions, 16 changer transitions 0/229 dead transitions. [2023-08-04 03:57:32,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 229 transitions, 976 flow [2023-08-04 03:57:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:57:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:57:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1642 transitions. [2023-08-04 03:57:32,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49398315282791816 [2023-08-04 03:57:32,743 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1642 transitions. [2023-08-04 03:57:32,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1642 transitions. [2023-08-04 03:57:32,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:32,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1642 transitions. [2023-08-04 03:57:32,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 273.6666666666667) internal successors, (1642), 6 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states 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 03:57:32,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 03:57:32,750 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 03:57:32,750 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 256 flow. Second operand 6 states and 1642 transitions. [2023-08-04 03:57:32,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 229 transitions, 976 flow [2023-08-04 03:57:32,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 229 transitions, 962 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:57:32,754 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 345 flow [2023-08-04 03:57:32,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2023-08-04 03:57:32,755 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2023-08-04 03:57:32,755 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 345 flow [2023-08-04 03:57:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.66666666666666) internal successors, (1444), 6 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states 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 03:57:32,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:32,755 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:32,763 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 03:57:32,960 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,SelfDestructingSolverStorable16 [2023-08-04 03:57:32,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:57:32,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1150539119, now seen corresponding path program 1 times [2023-08-04 03:57:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335087655] [2023-08-04 03:57:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:57:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335087655] [2023-08-04 03:57:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335087655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109361836] [2023-08-04 03:57:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:33,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:33,007 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 03:57:33,009 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 03:57:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:33,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:57:33,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:57:33,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:57:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109361836] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:33,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:33,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:57:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799593083] [2023-08-04 03:57:33,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:33,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:57:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:33,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:57:33,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:57:33,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 554 [2023-08-04 03:57:33,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 248.92857142857142) internal successors, (3485), 14 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states 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 03:57:33,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:33,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 554 [2023-08-04 03:57:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:35,920 INFO L124 PetriNetUnfolderBase]: 25818/40393 cut-off events. [2023-08-04 03:57:35,920 INFO L125 PetriNetUnfolderBase]: For 7557/7557 co-relation queries the response was YES. [2023-08-04 03:57:36,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86480 conditions, 40393 events. 25818/40393 cut-off events. For 7557/7557 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 302801 event pairs, 710 based on Foata normal form. 33/35645 useless extension candidates. Maximal degree in co-relation 86421. Up to 35243 conditions per place. [2023-08-04 03:57:36,134 INFO L140 encePairwiseOnDemand]: 548/554 looper letters, 141 selfloop transitions, 15 changer transitions 0/174 dead transitions. [2023-08-04 03:57:36,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 849 flow [2023-08-04 03:57:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:57:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:57:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3601 transitions. [2023-08-04 03:57:36,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-08-04 03:57:36,138 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3601 transitions. [2023-08-04 03:57:36,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3601 transitions. [2023-08-04 03:57:36,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:36,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3601 transitions. [2023-08-04 03:57:36,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 257.2142857142857) internal successors, (3601), 14 states have internal predecessors, (3601), 0 states have call successors, (0), 0 states 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 03:57:36,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 554.0) internal successors, (8310), 15 states have internal predecessors, (8310), 0 states have call successors, (0), 0 states 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 03:57:36,154 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 554.0) internal successors, (8310), 15 states have internal predecessors, (8310), 0 states have call successors, (0), 0 states 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 03:57:36,154 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 345 flow. Second operand 14 states and 3601 transitions. [2023-08-04 03:57:36,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 849 flow [2023-08-04 03:57:36,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 174 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:57:36,175 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 427 flow [2023-08-04 03:57:36,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=427, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2023-08-04 03:57:36,175 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 35 predicate places. [2023-08-04 03:57:36,175 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 427 flow [2023-08-04 03:57:36,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 248.92857142857142) internal successors, (3485), 14 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states 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 03:57:36,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:36,176 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:36,182 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 03:57:36,381 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,SelfDestructingSolverStorable17 [2023-08-04 03:57:36,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:57:36,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash 183254497, now seen corresponding path program 1 times [2023-08-04 03:57:36,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:36,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004363071] [2023-08-04 03:57:36,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004363071] [2023-08-04 03:57:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004363071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204620590] [2023-08-04 03:57:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:36,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:36,605 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 03:57:36,608 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 03:57:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:36,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 03:57:36,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:36,722 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 7 treesize of output 6 [2023-08-04 03:57:36,786 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:36,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:57:36,808 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 13 treesize of output 15 [2023-08-04 03:57:36,831 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 13 treesize of output 15 [2023-08-04 03:57:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:36,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204620590] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:45,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:45,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-04 03:57:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446604194] [2023-08-04 03:57:45,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:45,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 03:57:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:45,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 03:57:45,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=94, Unknown=3, NotChecked=0, Total=132 [2023-08-04 03:57:47,034 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 03:57:49,075 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 03:57:51,111 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 03:57:53,132 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 03:57:55,144 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 03:57:57,225 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 03:57:59,245 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 03:58:01,266 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 03:58:03,287 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 03:58:05,306 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 03:58:07,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 03:58:09,341 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 03:58:11,354 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 03:58:13,398 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 03:58:15,451 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 03:58:17,471 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 03:58:19,488 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 03:58:21,525 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 03:58:23,552 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 03:58:25,580 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 03:58:27,611 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 03:58:29,630 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 03:58:31,646 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 03:58:31,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 554 [2023-08-04 03:58:31,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 427 flow. Second operand has 12 states, 12 states have (on average 210.91666666666666) internal successors, (2531), 12 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states 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 03:58:31,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:58:31,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 554 [2023-08-04 03:58:31,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:58:35,340 INFO L124 PetriNetUnfolderBase]: 32839/50637 cut-off events. [2023-08-04 03:58:35,340 INFO L125 PetriNetUnfolderBase]: For 14907/14907 co-relation queries the response was YES. [2023-08-04 03:58:35,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111430 conditions, 50637 events. 32839/50637 cut-off events. For 14907/14907 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 378052 event pairs, 4698 based on Foata normal form. 0/44688 useless extension candidates. Maximal degree in co-relation 111356. Up to 30199 conditions per place. [2023-08-04 03:58:35,614 INFO L140 encePairwiseOnDemand]: 540/554 looper letters, 255 selfloop transitions, 33 changer transitions 0/304 dead transitions. [2023-08-04 03:58:35,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 304 transitions, 1517 flow [2023-08-04 03:58:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 03:58:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 03:58:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1720 transitions. [2023-08-04 03:58:35,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443527591542032 [2023-08-04 03:58:35,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1720 transitions. [2023-08-04 03:58:35,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1720 transitions. [2023-08-04 03:58:35,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:58:35,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1720 transitions. [2023-08-04 03:58:35,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 245.71428571428572) internal successors, (1720), 7 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states 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 03:58:35,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states 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 03:58:35,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states 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 03:58:35,622 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 427 flow. Second operand 7 states and 1720 transitions. [2023-08-04 03:58:35,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 304 transitions, 1517 flow [2023-08-04 03:58:35,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 304 transitions, 1440 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-08-04 03:58:35,660 INFO L231 Difference]: Finished difference. Result has 124 places, 137 transitions, 589 flow [2023-08-04 03:58:35,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=589, PETRI_PLACES=124, PETRI_TRANSITIONS=137} [2023-08-04 03:58:35,660 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 37 predicate places. [2023-08-04 03:58:35,660 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 137 transitions, 589 flow [2023-08-04 03:58:35,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 210.91666666666666) internal successors, (2531), 12 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states 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 03:58:35,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:58:35,661 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:58:35,669 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 03:58:35,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:58:35,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:58:35,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:58:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1892684362, now seen corresponding path program 1 times [2023-08-04 03:58:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:58:35,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475674896] [2023-08-04 03:58:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:58:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:58:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:58:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:58:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:58:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475674896] [2023-08-04 03:58:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475674896] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:58:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194520086] [2023-08-04 03:58:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:58:36,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:58:36,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:58:36,046 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 03:58:36,049 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 03:58:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:58:36,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 03:58:36,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:58:36,166 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 7 treesize of output 6 [2023-08-04 03:58:36,221 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:58:36,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-04 03:58:36,236 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 13 treesize of output 15 [2023-08-04 03:58:36,253 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 13 treesize of output 15 [2023-08-04 03:58:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:58:36,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:58:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:58:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194520086] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:58:46,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:58:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-04 03:58:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392825795] [2023-08-04 03:58:46,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:58:46,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 03:58:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:58:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 03:58:46,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=92, Unknown=5, NotChecked=0, Total=132 [2023-08-04 03:58:48,439 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 03:58:50,474 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 03:58:52,498 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 03:58:54,515 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 03:58:56,535 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 03:58:58,586 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 03:59:00,609 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 03:59:02,631 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 03:59:04,658 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 03:59:06,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:08,689 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 03:59:10,704 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 03:59:12,716 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 03:59:14,744 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 03:59:16,766 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 03:59:18,797 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 03:59:20,814 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 03:59:22,831 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 03:59:24,856 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 03:59:26,885 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 03:59:28,909 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 03:59:30,924 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 03:59:32,944 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 03:59:32,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 554 [2023-08-04 03:59:32,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 137 transitions, 589 flow. Second operand has 12 states, 12 states have (on average 211.08333333333334) internal successors, (2533), 12 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states 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 03:59:32,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:32,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 554 [2023-08-04 03:59:32,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:38,369 INFO L124 PetriNetUnfolderBase]: 48535/74463 cut-off events. [2023-08-04 03:59:38,369 INFO L125 PetriNetUnfolderBase]: For 45243/45243 co-relation queries the response was YES. [2023-08-04 03:59:38,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181373 conditions, 74463 events. 48535/74463 cut-off events. For 45243/45243 co-relation queries the response was YES. Maximal size of possible extension queue 1949. Compared 563377 event pairs, 9852 based on Foata normal form. 0/68841 useless extension candidates. Maximal degree in co-relation 170838. Up to 38413 conditions per place. [2023-08-04 03:59:38,726 INFO L140 encePairwiseOnDemand]: 542/554 looper letters, 273 selfloop transitions, 49 changer transitions 0/338 dead transitions. [2023-08-04 03:59:38,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 338 transitions, 1916 flow [2023-08-04 03:59:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 03:59:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 03:59:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1722 transitions. [2023-08-04 03:59:38,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44404332129963897 [2023-08-04 03:59:38,728 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1722 transitions. [2023-08-04 03:59:38,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1722 transitions. [2023-08-04 03:59:38,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:38,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1722 transitions. [2023-08-04 03:59:38,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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 03:59:38,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states 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 03:59:38,732 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states 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 03:59:38,733 INFO L175 Difference]: Start difference. First operand has 124 places, 137 transitions, 589 flow. Second operand 7 states and 1722 transitions. [2023-08-04 03:59:38,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 338 transitions, 1916 flow [2023-08-04 03:59:38,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 338 transitions, 1916 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:59:38,866 INFO L231 Difference]: Finished difference. Result has 134 places, 164 transitions, 989 flow [2023-08-04 03:59:38,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=989, PETRI_PLACES=134, PETRI_TRANSITIONS=164} [2023-08-04 03:59:38,866 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 47 predicate places. [2023-08-04 03:59:38,866 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 164 transitions, 989 flow [2023-08-04 03:59:38,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 211.08333333333334) internal successors, (2533), 12 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states 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 03:59:38,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:38,867 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:38,871 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 03:59:39,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:39,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:59:39,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 606857412, now seen corresponding path program 1 times [2023-08-04 03:59:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343000157] [2023-08-04 03:59:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:59:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343000157] [2023-08-04 03:59:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343000157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:39,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:59:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:59:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479034202] [2023-08-04 03:59:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:39,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:59:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:39,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:59:39,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:59:39,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 554 [2023-08-04 03:59:39,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 164 transitions, 989 flow. Second operand has 5 states, 5 states have (on average 228.6) internal successors, (1143), 5 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states 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 03:59:39,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:39,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 554 [2023-08-04 03:59:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:49,707 INFO L124 PetriNetUnfolderBase]: 80181/127235 cut-off events. [2023-08-04 03:59:49,707 INFO L125 PetriNetUnfolderBase]: For 138800/138845 co-relation queries the response was YES. [2023-08-04 03:59:50,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335899 conditions, 127235 events. 80181/127235 cut-off events. For 138800/138845 co-relation queries the response was YES. Maximal size of possible extension queue 2713. Compared 1081601 event pairs, 21233 based on Foata normal form. 9182/128444 useless extension candidates. Maximal degree in co-relation 315692. Up to 68688 conditions per place. [2023-08-04 03:59:50,550 INFO L140 encePairwiseOnDemand]: 525/554 looper letters, 294 selfloop transitions, 43 changer transitions 0/350 dead transitions. [2023-08-04 03:59:50,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 350 transitions, 2831 flow [2023-08-04 03:59:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:59:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:59:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1337 transitions. [2023-08-04 03:59:50,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826714801444043 [2023-08-04 03:59:50,552 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1337 transitions. [2023-08-04 03:59:50,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1337 transitions. [2023-08-04 03:59:50,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:50,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1337 transitions. [2023-08-04 03:59:50,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states 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 03:59:50,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 554.0) internal successors, (3324), 6 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states 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 03:59:50,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 554.0) internal successors, (3324), 6 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states 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 03:59:50,556 INFO L175 Difference]: Start difference. First operand has 134 places, 164 transitions, 989 flow. Second operand 5 states and 1337 transitions. [2023-08-04 03:59:50,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 350 transitions, 2831 flow [2023-08-04 03:59:51,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 350 transitions, 2831 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:59:51,130 INFO L231 Difference]: Finished difference. Result has 139 places, 194 transitions, 1222 flow [2023-08-04 03:59:51,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1222, PETRI_PLACES=139, PETRI_TRANSITIONS=194} [2023-08-04 03:59:51,131 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 52 predicate places. [2023-08-04 03:59:51,131 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 194 transitions, 1222 flow [2023-08-04 03:59:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 228.6) internal successors, (1143), 5 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states 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 03:59:51,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:51,131 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:51,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-04 03:59:51,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 03:59:51,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1678631934, now seen corresponding path program 1 times [2023-08-04 03:59:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313524604] [2023-08-04 03:59:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:59:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313524604] [2023-08-04 03:59:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313524604] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248839928] [2023-08-04 03:59:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:51,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:51,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:51,821 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 03:59:51,822 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 03:59:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:51,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-04 03:59:51,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:52,007 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 03:59:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:59:52,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:59:52,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248839928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:52,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:59:52,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-08-04 03:59:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095542139] [2023-08-04 03:59:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:52,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:59:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:59:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:59:52,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 554 [2023-08-04 03:59:52,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 194 transitions, 1222 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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 03:59:52,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:52,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 554 [2023-08-04 03:59:52,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:15,545 INFO L124 PetriNetUnfolderBase]: 158471/254756 cut-off events. [2023-08-04 04:00:15,545 INFO L125 PetriNetUnfolderBase]: For 358930/359658 co-relation queries the response was YES. [2023-08-04 04:00:16,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790977 conditions, 254756 events. 158471/254756 cut-off events. For 358930/359658 co-relation queries the response was YES. Maximal size of possible extension queue 6159. Compared 2415420 event pairs, 57329 based on Foata normal form. 2969/238412 useless extension candidates. Maximal degree in co-relation 748932. Up to 112118 conditions per place. [2023-08-04 04:00:17,646 INFO L140 encePairwiseOnDemand]: 533/554 looper letters, 467 selfloop transitions, 52 changer transitions 0/537 dead transitions. [2023-08-04 04:00:17,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 537 transitions, 4502 flow [2023-08-04 04:00:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:00:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:00:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1634 transitions. [2023-08-04 04:00:17,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915764139590854 [2023-08-04 04:00:17,648 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1634 transitions. [2023-08-04 04:00:17,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1634 transitions. [2023-08-04 04:00:17,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:17,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1634 transitions. [2023-08-04 04:00:17,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states 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 04:00:17,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 04:00:17,651 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 04:00:17,651 INFO L175 Difference]: Start difference. First operand has 139 places, 194 transitions, 1222 flow. Second operand 6 states and 1634 transitions. [2023-08-04 04:00:17,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 537 transitions, 4502 flow [2023-08-04 04:00:19,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 537 transitions, 4501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:00:19,128 INFO L231 Difference]: Finished difference. Result has 146 places, 242 transitions, 1750 flow [2023-08-04 04:00:19,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1750, PETRI_PLACES=146, PETRI_TRANSITIONS=242} [2023-08-04 04:00:19,129 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 59 predicate places. [2023-08-04 04:00:19,129 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 242 transitions, 1750 flow [2023-08-04 04:00:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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 04:00:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:19,129 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:00:19,135 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 04:00:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-04 04:00:19,330 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:00:19,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 845597004, now seen corresponding path program 2 times [2023-08-04 04:00:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:19,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159233632] [2023-08-04 04:00:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:00:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159233632] [2023-08-04 04:00:20,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159233632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:20,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496251122] [2023-08-04 04:00:20,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:00:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:20,016 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 04:00:20,019 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 04:00:20,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 04:00:20,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:00:20,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 04:00:20,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:20,203 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 13 treesize of output 9 [2023-08-04 04:00:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-04 04:00:20,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:00:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496251122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:00:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:00:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-08-04 04:00:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551840047] [2023-08-04 04:00:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:00:20,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:00:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:00:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-08-04 04:00:20,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 554 [2023-08-04 04:00:20,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 242 transitions, 1750 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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 04:00:20,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:20,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 554 [2023-08-04 04:00:20,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:19,115 INFO L124 PetriNetUnfolderBase]: 298603/483976 cut-off events. [2023-08-04 04:01:19,115 INFO L125 PetriNetUnfolderBase]: For 973603/975116 co-relation queries the response was YES. [2023-08-04 04:01:21,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680577 conditions, 483976 events. 298603/483976 cut-off events. For 973603/975116 co-relation queries the response was YES. Maximal size of possible extension queue 11851. Compared 4994353 event pairs, 113370 based on Foata normal form. 3986/447673 useless extension candidates. Maximal degree in co-relation 1578174. Up to 238260 conditions per place. [2023-08-04 04:01:23,517 INFO L140 encePairwiseOnDemand]: 534/554 looper letters, 514 selfloop transitions, 89 changer transitions 0/621 dead transitions. [2023-08-04 04:01:23,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 621 transitions, 5758 flow [2023-08-04 04:01:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:01:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:01:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2023-08-04 04:01:23,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49037304452466907 [2023-08-04 04:01:23,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1630 transitions. [2023-08-04 04:01:23,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1630 transitions. [2023-08-04 04:01:23,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:23,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1630 transitions. [2023-08-04 04:01:23,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 271.6666666666667) internal successors, (1630), 6 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states 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 04:01:23,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 04:01:23,522 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states 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 04:01:23,522 INFO L175 Difference]: Start difference. First operand has 146 places, 242 transitions, 1750 flow. Second operand 6 states and 1630 transitions. [2023-08-04 04:01:23,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 621 transitions, 5758 flow [2023-08-04 04:01:35,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 621 transitions, 5745 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:01:35,646 INFO L231 Difference]: Finished difference. Result has 152 places, 324 transitions, 2863 flow [2023-08-04 04:01:35,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2863, PETRI_PLACES=152, PETRI_TRANSITIONS=324} [2023-08-04 04:01:35,647 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 65 predicate places. [2023-08-04 04:01:35,647 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 324 transitions, 2863 flow [2023-08-04 04:01:35,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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 04:01:35,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:35,663 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:35,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-04 04:01:35,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:35,864 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:01:35,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2036399570, now seen corresponding path program 3 times [2023-08-04 04:01:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:35,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732246095] [2023-08-04 04:01:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:01:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732246095] [2023-08-04 04:01:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732246095] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906808973] [2023-08-04 04:01:36,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:01:36,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:36,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:36,495 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 04:01:36,497 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 04:01:36,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-04 04:01:36,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:01:36,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-04 04:01:36,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:36,711 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 13 treesize of output 9 [2023-08-04 04:01:36,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:36,737 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 16 treesize of output 18 [2023-08-04 04:01:36,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:36,758 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 16 treesize of output 18 [2023-08-04 04:01:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:01:36,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:01:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906808973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:01:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-04 04:01:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46328270] [2023-08-04 04:01:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:36,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:01:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:01:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-08-04 04:01:37,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 554 [2023-08-04 04:01:37,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 324 transitions, 2863 flow. Second operand has 7 states, 7 states have (on average 232.57142857142858) internal successors, (1628), 7 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states 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 04:01:37,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:37,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 554 [2023-08-04 04:01:37,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand