/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_73-funloop_hard_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:51:39,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:51:39,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:51:39,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:51:39,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:51:39,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:51:39,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:51:39,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:51:39,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:51:39,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:51:39,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:51:39,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:51:39,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:51:39,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:51:39,263 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:51:39,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:51:39,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:51:39,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:51:39,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:51:39,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:51:39,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:51:39,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:51:39,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:51:39,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:51:39,265 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:51:39,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:51:39,266 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:51:39,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:51:39,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:51:39,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:51:39,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:39,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:51:39,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:51:39,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:51:39,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:51:39,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:51:39,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:51:39,270 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:51:39,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:51:39,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:51:39,270 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:51:39,273 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:39,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:51:39,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:51:39,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:51:39,519 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:51:39,519 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:51:39,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_73-funloop_hard_racefree_bound2.i [2023-08-04 03:51:40,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:51:41,043 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:51:41,044 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_73-funloop_hard_racefree_bound2.i [2023-08-04 03:51:41,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f749ebd59/619c1573bb3b4385b2e9699a94ef2380/FLAGa376c1fe6 [2023-08-04 03:51:41,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f749ebd59/619c1573bb3b4385b2e9699a94ef2380 [2023-08-04 03:51:41,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:51:41,083 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:51:41,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:41,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:51:41,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:51:41,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:41" (1/1) ... [2023-08-04 03:51:41,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6707de6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:41, skipping insertion in model container [2023-08-04 03:51:41,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:41" (1/1) ... [2023-08-04 03:51:41,148 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:51:41,544 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_73-funloop_hard_racefree_bound2.i[41323,41336] [2023-08-04 03:51:41,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:41,586 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:51:41,609 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:41,610 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:41,629 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-04 03:51:41,636 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_73-funloop_hard_racefree_bound2.i[41323,41336] [2023-08-04 03:51:41,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:41,698 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:51:41,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:41 WrapperNode [2023-08-04 03:51:41,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:41,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:41,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:51:41,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:51:41,707 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:41" (1/1) ... [2023-08-04 03:51:41,740 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:41" (1/1) ... [2023-08-04 03:51:41,780 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-08-04 03:51:41,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:41,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:51:41,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:51:41,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:51:41,789 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:41" (1/1) ... [2023-08-04 03:51:41,790 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:41" (1/1) ... [2023-08-04 03:51:41,807 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:41" (1/1) ... [2023-08-04 03:51:41,807 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:41" (1/1) ... [2023-08-04 03:51:41,815 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:41" (1/1) ... [2023-08-04 03:51:41,820 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:41" (1/1) ... [2023-08-04 03:51:41,834 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:41" (1/1) ... [2023-08-04 03:51:41,835 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:41" (1/1) ... [2023-08-04 03:51:41,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:51:41,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:51:41,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:51:41,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:51:41,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:41" (1/1) ... [2023-08-04 03:51:41,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:41,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:41,878 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:41,898 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:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:51:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:51:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:51:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:51:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:51:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:51:41,923 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:51:41,924 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:51:41,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:51:41,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:51:41,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:51:41,926 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:42,068 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:51:42,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:51:42,344 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:51:42,352 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:51:42,353 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-04 03:51:42,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:42 BoogieIcfgContainer [2023-08-04 03:51:42,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:51:42,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:51:42,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:51:42,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:51:42,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:51:41" (1/3) ... [2023-08-04 03:51:42,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e34664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:42, skipping insertion in model container [2023-08-04 03:51:42,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:41" (2/3) ... [2023-08-04 03:51:42,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e34664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:42, skipping insertion in model container [2023-08-04 03:51:42,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:42" (3/3) ... [2023-08-04 03:51:42,363 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_73-funloop_hard_racefree_bound2.i [2023-08-04 03:51:42,371 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:51:42,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:51:42,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-04 03:51:42,378 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:51:42,463 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 03:51:42,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-08-04 03:51:42,609 INFO L124 PetriNetUnfolderBase]: 73/381 cut-off events. [2023-08-04 03:51:42,610 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:51:42,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 381 events. 73/381 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-04 03:51:42,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-08-04 03:51:42,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-08-04 03:51:42,634 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:42,649 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-04 03:51:42,651 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-04 03:51:42,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-08-04 03:51:42,721 INFO L124 PetriNetUnfolderBase]: 72/376 cut-off events. [2023-08-04 03:51:42,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:42,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 376 events. 72/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1659 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-04 03:51:42,736 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-08-04 03:51:45,444 INFO L134 LiptonReduction]: Checked pairs total: 28650 [2023-08-04 03:51:45,444 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-08-04 03:51:45,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:51:45,460 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;@3413525a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:51:45,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 03:51:45,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:51:45,465 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2023-08-04 03:51:45,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:45,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:45,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:45,466 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:45,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash -454048497, now seen corresponding path program 1 times [2023-08-04 03:51:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844721392] [2023-08-04 03:51:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:45,714 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:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:45,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844721392] [2023-08-04 03:51:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844721392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:51:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204160338] [2023-08-04 03:51:45,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:45,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:45,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-04 03:51:45,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:45,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-04 03:51:45,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:46,023 INFO L124 PetriNetUnfolderBase]: 579/1212 cut-off events. [2023-08-04 03:51:46,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:46,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 1212 events. 579/1212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6864 event pairs, 465 based on Foata normal form. 213/1209 useless extension candidates. Maximal degree in co-relation 2191. Up to 1060 conditions per place. [2023-08-04 03:51:46,031 INFO L140 encePairwiseOnDemand]: 396/430 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-04 03:51:46,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-04 03:51:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-08-04 03:51:46,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286821705426357 [2023-08-04 03:51:46,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-08-04 03:51:46,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-08-04 03:51:46,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:46,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-08-04 03:51:46,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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:46,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:51:46,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:51:46,072 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 197 flow. Second operand 3 states and 682 transitions. [2023-08-04 03:51:46,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-04 03:51:46,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:51:46,077 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 147 flow [2023-08-04 03:51:46,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-04 03:51:46,083 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-04 03:51:46,083 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 147 flow [2023-08-04 03:51:46,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:46,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:46,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:51:46,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:46,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 573264157, now seen corresponding path program 1 times [2023-08-04 03:51:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584499253] [2023-08-04 03:51:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,152 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:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:46,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584499253] [2023-08-04 03:51:46,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584499253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:46,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:46,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 03:51:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037115362] [2023-08-04 03:51:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:46,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:46,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:46,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:46,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:46,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-04 03:51:46,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:46,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-04 03:51:46,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:46,326 INFO L124 PetriNetUnfolderBase]: 547/1178 cut-off events. [2023-08-04 03:51:46,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:46,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 1178 events. 547/1178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7289 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2224. Up to 1012 conditions per place. [2023-08-04 03:51:46,332 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-04 03:51:46,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 321 flow [2023-08-04 03:51:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2023-08-04 03:51:46,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170542635658915 [2023-08-04 03:51:46,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2023-08-04 03:51:46,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2023-08-04 03:51:46,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:46,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2023-08-04 03:51:46,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:46,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:51:46,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:51:46,340 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 147 flow. Second operand 3 states and 667 transitions. [2023-08-04 03:51:46,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 321 flow [2023-08-04 03:51:46,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:46,343 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 151 flow [2023-08-04 03:51:46,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-04 03:51:46,344 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2023-08-04 03:51:46,344 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 151 flow [2023-08-04 03:51:46,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:51:46,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:46,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:46,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 03:51:46,345 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:46,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash -646993721, now seen corresponding path program 1 times [2023-08-04 03:51:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434897546] [2023-08-04 03:51:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,427 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:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434897546] [2023-08-04 03:51:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434897546] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590761209] [2023-08-04 03:51:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:46,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:46,433 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:46,442 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:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:46,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:51:46,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:46,583 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:46,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:46,608 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:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590761209] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:46,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:46,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:51:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614428398] [2023-08-04 03:51:46,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:51:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:51:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:51:46,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-04 03:51:46,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:46,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-04 03:51:46,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:46,842 INFO L124 PetriNetUnfolderBase]: 576/1192 cut-off events. [2023-08-04 03:51:46,842 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-04 03:51:46,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1192 events. 576/1192 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6683 event pairs, 465 based on Foata normal form. 3/1005 useless extension candidates. Maximal degree in co-relation 2262. Up to 1030 conditions per place. [2023-08-04 03:51:46,848 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-04 03:51:46,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 275 flow [2023-08-04 03:51:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1247 transitions. [2023-08-04 03:51:46,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-04 03:51:46,852 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1247 transitions. [2023-08-04 03:51:46,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1247 transitions. [2023-08-04 03:51:46,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:46,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1247 transitions. [2023-08-04 03:51:46,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.83333333333334) internal successors, (1247), 6 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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:46,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states 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:46,860 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states 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:46,860 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 151 flow. Second operand 6 states and 1247 transitions. [2023-08-04 03:51:46,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 275 flow [2023-08-04 03:51:46,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:51:46,863 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 183 flow [2023-08-04 03:51:46,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-04 03:51:46,864 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-08-04 03:51:46,864 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 183 flow [2023-08-04 03:51:46,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:46,865 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:46,877 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:47,077 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:47,077 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:47,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash -254815792, now seen corresponding path program 2 times [2023-08-04 03:51:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320744499] [2023-08-04 03:51:47,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:47,229 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:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320744499] [2023-08-04 03:51:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320744499] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820226624] [2023-08-04 03:51:47,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:51:47,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:47,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:47,237 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:47,240 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:47,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:51:47,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:51:47,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:51:47,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:47,353 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:47,410 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:47,410 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:47,431 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:47,478 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:47,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820226624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:47,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:47,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:51:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687460970] [2023-08-04 03:51:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:47,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:51:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:51:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:51:47,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 430 [2023-08-04 03:51:47,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states 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:47,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:47,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 430 [2023-08-04 03:51:47,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:47,946 INFO L124 PetriNetUnfolderBase]: 814/1702 cut-off events. [2023-08-04 03:51:47,946 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-04 03:51:47,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1702 events. 814/1702 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10255 event pairs, 106 based on Foata normal form. 0/1427 useless extension candidates. Maximal degree in co-relation 3266. Up to 1029 conditions per place. [2023-08-04 03:51:47,954 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2023-08-04 03:51:47,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 529 flow [2023-08-04 03:51:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:51:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:51:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1052 transitions. [2023-08-04 03:51:47,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48930232558139536 [2023-08-04 03:51:47,958 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1052 transitions. [2023-08-04 03:51:47,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1052 transitions. [2023-08-04 03:51:47,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:47,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1052 transitions. [2023-08-04 03:51:47,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 210.4) internal successors, (1052), 5 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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:47,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states 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:47,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states 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:47,965 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 183 flow. Second operand 5 states and 1052 transitions. [2023-08-04 03:51:47,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 529 flow [2023-08-04 03:51:47,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 126 transitions, 515 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:47,969 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 219 flow [2023-08-04 03:51:47,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-08-04 03:51:47,969 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-08-04 03:51:47,970 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 219 flow [2023-08-04 03:51:47,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states 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:47,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:47,971 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:47,977 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:48,177 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:48,177 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:48,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1650306531, now seen corresponding path program 1 times [2023-08-04 03:51:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271155641] [2023-08-04 03:51:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:48,230 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:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271155641] [2023-08-04 03:51:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271155641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428788180] [2023-08-04 03:51:48,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:48,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:48,234 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:48,236 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:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:48,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:51:48,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:48,355 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:48,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:48,408 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:48,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428788180] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:48,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:48,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:51:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534680658] [2023-08-04 03:51:48,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:48,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:51:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:51:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:51:48,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 430 [2023-08-04 03:51:48,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 219 flow. Second operand has 14 states, 14 states have (on average 195.92857142857142) internal successors, (2743), 14 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states 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:48,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:48,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 430 [2023-08-04 03:51:48,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:48,544 INFO L124 PetriNetUnfolderBase]: 61/186 cut-off events. [2023-08-04 03:51:48,544 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-04 03:51:48,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 186 events. 61/186 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 1 based on Foata normal form. 33/213 useless extension candidates. Maximal degree in co-relation 399. Up to 111 conditions per place. [2023-08-04 03:51:48,545 INFO L140 encePairwiseOnDemand]: 425/430 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-08-04 03:51:48,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 306 flow [2023-08-04 03:51:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:51:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:51:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2772 transitions. [2023-08-04 03:51:48,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2023-08-04 03:51:48,552 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2772 transitions. [2023-08-04 03:51:48,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2772 transitions. [2023-08-04 03:51:48,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:48,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2772 transitions. [2023-08-04 03:51:48,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 198.0) internal successors, (2772), 14 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states 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:48,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 430.0) internal successors, (6450), 15 states have internal predecessors, (6450), 0 states have call successors, (0), 0 states 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:48,568 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 430.0) internal successors, (6450), 15 states have internal predecessors, (6450), 0 states have call successors, (0), 0 states 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:48,568 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 219 flow. Second operand 14 states and 2772 transitions. [2023-08-04 03:51:48,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 306 flow [2023-08-04 03:51:48,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 03:51:48,571 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-08-04 03:51:48,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=169, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-04 03:51:48,572 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-08-04 03:51:48,572 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-08-04 03:51:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 195.92857142857142) internal successors, (2743), 14 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states 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:48,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:48,573 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:48,583 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:48,779 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:48,780 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:48,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -630653115, now seen corresponding path program 1 times [2023-08-04 03:51:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143207797] [2023-08-04 03:51:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:49,732 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:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143207797] [2023-08-04 03:51:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143207797] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867287980] [2023-08-04 03:51:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:49,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:49,735 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:49,738 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:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:49,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-04 03:51:49,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:49,853 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:49,937 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:49,938 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:49,966 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:50,076 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:50,148 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:50,208 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:50,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:58,296 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= 0 (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-08-04 03:52:00,311 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= (select (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_57|) 0)) is different from false [2023-08-04 03:52:02,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= 0 (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-08-04 03:52:10,380 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_200 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_200) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-04 03:52:10,474 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:52:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867287980] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:10,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-04 03:52:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121491811] [2023-08-04 03:52:10,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:10,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 03:52:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 03:52:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=332, Unknown=5, NotChecked=164, Total=600 [2023-08-04 03:52:10,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 430 [2023-08-04 03:52:10,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 169 flow. Second operand has 25 states, 25 states have (on average 146.4) internal successors, (3660), 25 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states 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:10,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:10,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 430 [2023-08-04 03:52:10,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:16,929 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 52 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:52:23,006 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:52:43,139 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 45 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:52:45,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:47,216 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:52:49,221 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:52:51,225 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:52:53,237 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:52:55,241 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:52:57,253 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:52:59,257 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:53:01,261 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:53:03,270 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:53:05,277 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:53:10,426 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:53:13,365 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:53:15,372 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:53:17,386 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:53:19,398 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:53:21,409 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:53:23,429 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:53:25,435 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:53:27,440 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:53:29,449 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:53:31,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:53:39,762 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 39 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:53:39,868 INFO L124 PetriNetUnfolderBase]: 60/193 cut-off events. [2023-08-04 03:53:39,868 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-04 03:53:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 193 events. 60/193 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 551 event pairs, 0 based on Foata normal form. 3/189 useless extension candidates. Maximal degree in co-relation 400. Up to 35 conditions per place. [2023-08-04 03:53:39,869 INFO L140 encePairwiseOnDemand]: 419/430 looper letters, 59 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2023-08-04 03:53:39,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 497 flow [2023-08-04 03:53:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 03:53:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 03:53:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2530 transitions. [2023-08-04 03:53:39,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34610123119015046 [2023-08-04 03:53:39,878 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2530 transitions. [2023-08-04 03:53:39,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2530 transitions. [2023-08-04 03:53:39,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:39,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2530 transitions. [2023-08-04 03:53:39,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 148.8235294117647) internal successors, (2530), 17 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states 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:39,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 states 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:39,894 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 states 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:39,894 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 169 flow. Second operand 17 states and 2530 transitions. [2023-08-04 03:53:39,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 497 flow [2023-08-04 03:53:39,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 423 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-04 03:53:39,897 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 265 flow [2023-08-04 03:53:39,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=265, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-08-04 03:53:39,898 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-08-04 03:53:39,898 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 265 flow [2023-08-04 03:53:39,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 146.4) internal successors, (3660), 25 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states 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:39,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:39,900 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:39,911 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:53:40,106 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:53:40,106 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:53:40,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash 470240073, now seen corresponding path program 1 times [2023-08-04 03:53:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947247007] [2023-08-04 03:53:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:41,437 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:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947247007] [2023-08-04 03:53:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947247007] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384468341] [2023-08-04 03:53:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:41,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:41,439 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:53:41,440 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:53:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:41,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:53:41,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:41,548 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:41,623 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:41,623 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:41,666 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:41,762 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:41,840 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:41,890 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:45,073 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:45,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:59,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-04 03:54:01,176 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_304)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-04 03:54:01,195 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303))) (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_304))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-04 03:54:01,222 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_302)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303))) (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_304))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-04 03:54:01,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| 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_62| v_ArrVal_302)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_304) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-04 03:54:01,295 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_300))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_302))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_304) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-04 03:54:01,507 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:54:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384468341] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:54:01,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:54:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2023-08-04 03:54:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256396127] [2023-08-04 03:54:01,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:54:01,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-04 03:54:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:54:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-04 03:54:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=388, Unknown=14, NotChecked=270, Total=756 [2023-08-04 03:54:01,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-08-04 03:54:01,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 265 flow. Second operand has 28 states, 28 states have (on average 150.28571428571428) internal successors, (4208), 28 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states 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:01,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:54:01,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-08-04 03:54:01,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:54:05,554 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:54:07,678 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:54:37,082 INFO L124 PetriNetUnfolderBase]: 134/391 cut-off events. [2023-08-04 03:54:37,082 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-08-04 03:54:37,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 391 events. 134/391 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1407 event pairs, 0 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1061. Up to 103 conditions per place. [2023-08-04 03:54:37,085 INFO L140 encePairwiseOnDemand]: 418/430 looper letters, 132 selfloop transitions, 56 changer transitions 0/192 dead transitions. [2023-08-04 03:54:37,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 192 transitions, 1159 flow [2023-08-04 03:54:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-04 03:54:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-04 03:54:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3236 transitions. [2023-08-04 03:54:37,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3583610188261351 [2023-08-04 03:54:37,095 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3236 transitions. [2023-08-04 03:54:37,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3236 transitions. [2023-08-04 03:54:37,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:54:37,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3236 transitions. [2023-08-04 03:54:37,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 154.0952380952381) internal successors, (3236), 21 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states 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:37,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states 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:37,117 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states 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:37,117 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 265 flow. Second operand 21 states and 3236 transitions. [2023-08-04 03:54:37,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 192 transitions, 1159 flow [2023-08-04 03:54:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 192 transitions, 1126 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-04 03:54:37,123 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 721 flow [2023-08-04 03:54:37,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=721, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2023-08-04 03:54:37,124 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 28 predicate places. [2023-08-04 03:54:37,124 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 721 flow [2023-08-04 03:54:37,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 150.28571428571428) internal successors, (4208), 28 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states 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:37,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:54:37,126 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:54:37,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 03:54:37,337 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:54:37,337 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:54:37,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:54:37,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1435047, now seen corresponding path program 2 times [2023-08-04 03:54:37,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:54:37,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517127520] [2023-08-04 03:54:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:54:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:54:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:54:38,485 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:54:38,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:54:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517127520] [2023-08-04 03:54:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517127520] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:54:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517099539] [2023-08-04 03:54:38,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:54:38,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:54:38,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:54:38,487 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:54:38,492 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:54:38,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:54:38,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:54:38,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:54:38,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:54:38,607 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:54:38,679 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:54:38,679 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:54:38,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:54:38,821 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:54:38,900 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:54:41,259 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:54:41,316 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:54:41,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:54:41,368 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-08-04 03:54:43,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-08-04 03:54:45,405 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_404)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-08-04 03:54:45,471 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int)) (or (= (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_66| v_ArrVal_404)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 28)))) is different from false [2023-08-04 03:54:45,496 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int) (v_ArrVal_401 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_401))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_404))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 28)))) is different from false [2023-08-04 03:54:45,677 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:54:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517099539] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:54:45,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:54:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-08-04 03:54:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513469767] [2023-08-04 03:54:45,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:54:45,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-04 03:54:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:54:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-04 03:54:45,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=394, Unknown=14, NotChecked=220, Total=702 [2023-08-04 03:54:45,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-08-04 03:54:45,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 721 flow. Second operand has 27 states, 27 states have (on average 150.40740740740742) internal successors, (4061), 27 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states 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:45,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:54:45,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-08-04 03:54:45,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:54:46,829 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:55:11,709 WARN L233 SmtUtils]: Spent 18.06s on a formula simplification. DAG size of input: 58 DAG size of output: 23 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:55:19,118 INFO L124 PetriNetUnfolderBase]: 167/548 cut-off events. [2023-08-04 03:55:19,118 INFO L125 PetriNetUnfolderBase]: For 1421/1421 co-relation queries the response was YES. [2023-08-04 03:55:19,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 548 events. 167/548 cut-off events. For 1421/1421 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2544 event pairs, 12 based on Foata normal form. 3/529 useless extension candidates. Maximal degree in co-relation 1999. Up to 109 conditions per place. [2023-08-04 03:55:19,123 INFO L140 encePairwiseOnDemand]: 420/430 looper letters, 178 selfloop transitions, 59 changer transitions 0/241 dead transitions. [2023-08-04 03:55:19,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 241 transitions, 1969 flow [2023-08-04 03:55:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 03:55:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 03:55:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3401 transitions. [2023-08-04 03:55:19,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3595137420718816 [2023-08-04 03:55:19,132 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3401 transitions. [2023-08-04 03:55:19,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3401 transitions. [2023-08-04 03:55:19,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:55:19,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3401 transitions. [2023-08-04 03:55:19,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 154.5909090909091) internal successors, (3401), 22 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states 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:55:19,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 430.0) internal successors, (9890), 23 states have internal predecessors, (9890), 0 states have call successors, (0), 0 states 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:55:19,152 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 430.0) internal successors, (9890), 23 states have internal predecessors, (9890), 0 states have call successors, (0), 0 states 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:55:19,152 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 721 flow. Second operand 22 states and 3401 transitions. [2023-08-04 03:55:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 241 transitions, 1969 flow [2023-08-04 03:55:19,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 241 transitions, 1943 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-04 03:55:19,163 INFO L231 Difference]: Finished difference. Result has 118 places, 133 transitions, 1101 flow [2023-08-04 03:55:19,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1101, PETRI_PLACES=118, PETRI_TRANSITIONS=133} [2023-08-04 03:55:19,164 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2023-08-04 03:55:19,164 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 133 transitions, 1101 flow [2023-08-04 03:55:19,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 150.40740740740742) internal successors, (4061), 27 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states 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:55:19,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:55:19,166 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:55:19,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 03:55:19,371 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:55:19,372 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:55:19,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:55:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1374964814, now seen corresponding path program 3 times [2023-08-04 03:55:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:55:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974666388] [2023-08-04 03:55:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:55:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:55:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:55:20,315 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:55:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:55:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974666388] [2023-08-04 03:55:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974666388] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:55:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469364779] [2023-08-04 03:55:20,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:55:20,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:55:20,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:55:20,322 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:55:20,326 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:55:20,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:55:20,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:55:20,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-04 03:55:20,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:55:20,467 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:55:20,525 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:20,526 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:55:20,535 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:55:20,638 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:55:20,686 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:55:20,748 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:55:20,851 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:55:20,916 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:55:30,830 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:55:30,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:55:44,905 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-04 03:55:46,938 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |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_543)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-04 03:56:09,114 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (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_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-04 03:56:11,138 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| 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_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-04 03:56:12,309 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (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_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-04 03:56:12,330 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 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_537))) (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| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-04 03:56:12,342 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (or (= 0 (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_537))) (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| (+ (- 1) (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-04 03:56:26,559 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_534))) (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_537) |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-04 03:56:26,764 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:56:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469364779] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:56:26,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:56:26,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2023-08-04 03:56:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137066799] [2023-08-04 03:56:26,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:56:26,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-04 03:56:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:56:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-04 03:56:26,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=546, Unknown=41, NotChecked=456, Total=1190 [2023-08-04 03:56:26,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-08-04 03:56:26,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 133 transitions, 1101 flow. Second operand has 35 states, 35 states have (on average 151.57142857142858) internal successors, (5305), 35 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states 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:56:26,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:56:26,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-08-04 03:56:26,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:56:28,019 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:29,234 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:30,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:33,047 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:56:34,236 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:35,443 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:36,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s 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,871 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:56:39,040 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:56:43,033 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:44,220 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:45,411 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:56:46,657 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:56:50,272 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:51,400 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:56:52,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:53,835 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:54,997 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:56:56,254 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:57,435 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:58,681 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:57:04,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:06,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:07,247 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:08,411 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:57:18,883 WARN L233 SmtUtils]: Spent 8.05s 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:57:20,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:32,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:46,299 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:57:47,417 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:57:49,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:57:52,752 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:57:53,954 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:57:55,171 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:57:56,378 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:58:12,303 WARN L233 SmtUtils]: Spent 12.16s 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:58:13,551 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:58:14,747 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:58:17,649 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:58:41,643 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:58:42,848 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:58:44,049 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:58:45,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:58:46,582 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:58:47,775 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:58:48,972 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:58:58,599 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 79 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:59:01,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:59:08,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:59:08,979 INFO L124 PetriNetUnfolderBase]: 181/613 cut-off events. [2023-08-04 03:59:08,979 INFO L125 PetriNetUnfolderBase]: For 2630/2630 co-relation queries the response was YES. [2023-08-04 03:59:08,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 613 events. 181/613 cut-off events. For 2630/2630 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3004 event pairs, 15 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 2467. Up to 124 conditions per place. [2023-08-04 03:59:08,983 INFO L140 encePairwiseOnDemand]: 417/430 looper letters, 0 selfloop transitions, 0 changer transitions 184/184 dead transitions. [2023-08-04 03:59:08,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 184 transitions, 1825 flow [2023-08-04 03:59:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-04 03:59:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-04 03:59:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2762 transitions. [2023-08-04 03:59:08,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35684754521963824 [2023-08-04 03:59:08,992 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2762 transitions. [2023-08-04 03:59:08,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2762 transitions. [2023-08-04 03:59:08,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:08,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2762 transitions. [2023-08-04 03:59:08,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 153.44444444444446) internal successors, (2762), 18 states have internal predecessors, (2762), 0 states have call successors, (0), 0 states 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:09,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 430.0) internal successors, (8170), 19 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states 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:09,008 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 430.0) internal successors, (8170), 19 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states 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:09,008 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 1101 flow. Second operand 18 states and 2762 transitions. [2023-08-04 03:59:09,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 184 transitions, 1825 flow [2023-08-04 03:59:09,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 184 transitions, 1675 flow, removed 33 selfloop flow, removed 12 redundant places. [2023-08-04 03:59:09,019 INFO L231 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2023-08-04 03:59:09,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=0, PETRI_PLACES=122, PETRI_TRANSITIONS=0} [2023-08-04 03:59:09,020 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 59 predicate places. [2023-08-04 03:59:09,020 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 0 transitions, 0 flow [2023-08-04 03:59:09,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 151.57142857142858) internal successors, (5305), 35 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states 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:09,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 03:59:09,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 03:59:09,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 03:59:09,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 03:59:09,032 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:59:09,232 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:59:09,233 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-08-04 03:59:09,235 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 03:59:09,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-08-04 03:59:09,262 INFO L124 PetriNetUnfolderBase]: 73/381 cut-off events. [2023-08-04 03:59:09,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:59:09,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 381 events. 73/381 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-04 03:59:09,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-08-04 03:59:09,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-08-04 03:59:09,266 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:59:09,266 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-04 03:59:09,266 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-04 03:59:09,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-08-04 03:59:09,289 INFO L124 PetriNetUnfolderBase]: 72/376 cut-off events. [2023-08-04 03:59:09,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:59:09,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 376 events. 72/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1659 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-04 03:59:09,299 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-08-04 03:59:11,752 INFO L134 LiptonReduction]: Checked pairs total: 31438 [2023-08-04 03:59:11,752 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-08-04 03:59:11,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:59:11,754 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;@3413525a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:59:11,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:59:11,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:59:11,757 INFO L124 PetriNetUnfolderBase]: 16/54 cut-off events. [2023-08-04 03:59:11,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:59:11,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:11,757 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 03:59:11,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:59:11,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash 742146464, now seen corresponding path program 1 times [2023-08-04 03:59:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2535632] [2023-08-04 03:59:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:11,776 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:59:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2535632] [2023-08-04 03:59:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2535632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:11,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:59:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:59:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760586472] [2023-08-04 03:59:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:11,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:59:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:59:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:59:11,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-04 03:59:11,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:11,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:11,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-04 03:59:11,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:11,911 INFO L124 PetriNetUnfolderBase]: 579/1211 cut-off events. [2023-08-04 03:59:11,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:59:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 1211 events. 579/1211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6859 event pairs, 465 based on Foata normal form. 214/1212 useless extension candidates. Maximal degree in co-relation 2190. Up to 1060 conditions per place. [2023-08-04 03:59:11,914 INFO L140 encePairwiseOnDemand]: 395/430 looper letters, 22 selfloop transitions, 2 changer transitions 37/66 dead transitions. [2023-08-04 03:59:11,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-04 03:59:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:59:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:59:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2023-08-04 03:59:11,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294573643410853 [2023-08-04 03:59:11,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 683 transitions. [2023-08-04 03:59:11,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 683 transitions. [2023-08-04 03:59:11,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:11,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 683 transitions. [2023-08-04 03:59:11,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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:11,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:59:11,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:59:11,919 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 683 transitions. [2023-08-04 03:59:11,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-04 03:59:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:59:11,921 INFO L231 Difference]: Finished difference. Result has 65 places, 29 transitions, 73 flow [2023-08-04 03:59:11,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=65, PETRI_TRANSITIONS=29} [2023-08-04 03:59:11,921 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-04 03:59:11,921 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 29 transitions, 73 flow [2023-08-04 03:59:11,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:11,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:11,922 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:11,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 03:59:11,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:59:11,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1451583011, now seen corresponding path program 1 times [2023-08-04 03:59:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050203338] [2023-08-04 03:59:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:11,944 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:59:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050203338] [2023-08-04 03:59:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050203338] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418824578] [2023-08-04 03:59:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:11,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:11,949 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:59:11,952 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:59:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:12,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:59:12,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:12,045 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:59:12,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:12,056 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:59:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418824578] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:12,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:59:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037149112] [2023-08-04 03:59:12,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:12,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:59:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:59:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:59:12,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-04 03:59:12,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 29 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 199.57142857142858) internal successors, (1397), 7 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states 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:12,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:12,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-04 03:59:12,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:12,131 INFO L124 PetriNetUnfolderBase]: 54/139 cut-off events. [2023-08-04 03:59:12,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:59:12,132 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 375 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:59:12,132 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-08-04 03:59:12,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 139 flow [2023-08-04 03:59:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:59:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:59:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1218 transitions. [2023-08-04 03:59:12,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2023-08-04 03:59:12,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1218 transitions. [2023-08-04 03:59:12,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1218 transitions. [2023-08-04 03:59:12,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:12,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1218 transitions. [2023-08-04 03:59:12,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:12,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states 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:12,140 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states 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:12,140 INFO L175 Difference]: Start difference. First operand has 65 places, 29 transitions, 73 flow. Second operand 6 states and 1218 transitions. [2023-08-04 03:59:12,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 139 flow [2023-08-04 03:59:12,140 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:59:12,141 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-08-04 03:59:12,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, 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:59:12,142 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-08-04 03:59:12,142 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-08-04 03:59:12,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.57142857142858) internal successors, (1397), 7 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states 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:12,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:12,143 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-04 03:59:12,152 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:59:12,352 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:59:12,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:59:12,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1255216928, now seen corresponding path program 2 times [2023-08-04 03:59:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:12,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031181986] [2023-08-04 03:59:12,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:12,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:12,419 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:59:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031181986] [2023-08-04 03:59:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031181986] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702255633] [2023-08-04 03:59:12,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:59:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:12,421 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:59:12,424 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:59:12,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:59:12,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:59:12,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:59:12,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:12,529 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:59:12,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:12,584 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:59:12,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702255633] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:12,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:12,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:59:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447827506] [2023-08-04 03:59:12,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:12,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:59:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:59:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:59:12,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-04 03:59:12,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 105 flow. Second operand has 13 states, 13 states have (on average 199.30769230769232) internal successors, (2591), 13 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states 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:12,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:12,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-04 03:59:12,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:12,682 INFO L124 PetriNetUnfolderBase]: 54/145 cut-off events. [2023-08-04 03:59:12,682 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 03:59:12,683 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 379 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:59:12,683 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-04 03:59:12,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 207 flow [2023-08-04 03:59:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:59:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:59:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2415 transitions. [2023-08-04 03:59:12,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2023-08-04 03:59:12,687 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2415 transitions. [2023-08-04 03:59:12,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2415 transitions. [2023-08-04 03:59:12,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:12,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2415 transitions. [2023-08-04 03:59:12,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 201.25) internal successors, (2415), 12 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states 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:12,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 430.0) internal successors, (5590), 13 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states 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:12,695 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 430.0) internal successors, (5590), 13 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states 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:12,696 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 2415 transitions. [2023-08-04 03:59:12,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 207 flow [2023-08-04 03:59:12,696 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:59:12,697 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-08-04 03:59:12,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, 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:59:12,698 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-08-04 03:59:12,698 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-08-04 03:59:12,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 199.30769230769232) internal successors, (2591), 13 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states 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:12,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:12,699 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-04 03:59:12,708 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:59:12,904 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:59:12,904 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:59:12,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash -527083584, now seen corresponding path program 3 times [2023-08-04 03:59:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995667602] [2023-08-04 03:59:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:59:12,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:59:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:59:12,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:59:12,948 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:59:12,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:59:12,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 03:59:12,950 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-04 03:59:12,950 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:59:12,951 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:59:12,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:59:12,983 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 03:59:12,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 317 transitions, 652 flow [2023-08-04 03:59:13,071 INFO L124 PetriNetUnfolderBase]: 118/611 cut-off events. [2023-08-04 03:59:13,071 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 03:59:13,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 611 events. 118/611 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3087 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2023-08-04 03:59:13,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 317 transitions, 652 flow [2023-08-04 03:59:13,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 317 transitions, 652 flow [2023-08-04 03:59:13,081 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:59:13,081 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 317 transitions, 652 flow [2023-08-04 03:59:13,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 317 transitions, 652 flow [2023-08-04 03:59:13,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 317 transitions, 652 flow [2023-08-04 03:59:13,132 INFO L124 PetriNetUnfolderBase]: 118/611 cut-off events. [2023-08-04 03:59:13,132 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 03:59:13,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 611 events. 118/611 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3087 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2023-08-04 03:59:13,160 INFO L119 LiptonReduction]: Number of co-enabled transitions 49956 [2023-08-04 03:59:16,178 INFO L134 LiptonReduction]: Checked pairs total: 85784 [2023-08-04 03:59:16,178 INFO L136 LiptonReduction]: Total number of compositions: 243 [2023-08-04 03:59:16,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:59:16,180 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;@3413525a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:59:16,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-04 03:59:16,182 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:59:16,182 INFO L124 PetriNetUnfolderBase]: 9/36 cut-off events. [2023-08-04 03:59:16,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:59:16,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:16,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:16,183 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:59:16,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash -671268620, now seen corresponding path program 1 times [2023-08-04 03:59:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053507119] [2023-08-04 03:59:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:16,198 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:59:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053507119] [2023-08-04 03:59:16,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053507119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:16,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:59:16,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:59:16,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334809246] [2023-08-04 03:59:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:16,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:59:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:16,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:59:16,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:59:16,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 560 [2023-08-04 03:59:16,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 133 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:16,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:16,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 560 [2023-08-04 03:59:16,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:18,226 INFO L124 PetriNetUnfolderBase]: 19961/30642 cut-off events. [2023-08-04 03:59:18,226 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-08-04 03:59:18,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58969 conditions, 30642 events. 19961/30642 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 212646 event pairs, 17166 based on Foata normal form. 5462/30473 useless extension candidates. Maximal degree in co-relation 20159. Up to 28224 conditions per place. [2023-08-04 03:59:18,372 INFO L140 encePairwiseOnDemand]: 516/560 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-04 03:59:18,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 354 flow [2023-08-04 03:59:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:59:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:59:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2023-08-04 03:59:18,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2023-08-04 03:59:18,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 882 transitions. [2023-08-04 03:59:18,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 882 transitions. [2023-08-04 03:59:18,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:18,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 882 transitions. [2023-08-04 03:59:18,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:18,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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:18,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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:18,378 INFO L175 Difference]: Start difference. First operand has 87 places, 133 transitions, 284 flow. Second operand 3 states and 882 transitions. [2023-08-04 03:59:18,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 354 flow [2023-08-04 03:59:18,379 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:59:18,380 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 214 flow [2023-08-04 03:59:18,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:59:18,381 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2023-08-04 03:59:18,381 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 214 flow [2023-08-04 03:59:18,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:18,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:18,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:18,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 03:59:18,381 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:59:18,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1949750384, now seen corresponding path program 1 times [2023-08-04 03:59:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815845131] [2023-08-04 03:59:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:18,402 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:59:18,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:18,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815845131] [2023-08-04 03:59:18,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815845131] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:18,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047698007] [2023-08-04 03:59:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:18,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:18,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:18,404 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:59:18,437 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:59:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:18,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:59:18,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:18,514 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:59:18,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:59:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047698007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:18,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:59:18,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:59:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034799712] [2023-08-04 03:59:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:18,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:59:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:59:18,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:59:18,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 560 [2023-08-04 03:59:18,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states 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:18,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:18,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 560 [2023-08-04 03:59:18,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:20,061 INFO L124 PetriNetUnfolderBase]: 19644/30266 cut-off events. [2023-08-04 03:59:20,061 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 03:59:20,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58589 conditions, 30266 events. 19644/30266 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 213281 event pairs, 8256 based on Foata normal form. 0/24593 useless extension candidates. Maximal degree in co-relation 58576. Up to 28177 conditions per place. [2023-08-04 03:59:20,294 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 91 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-08-04 03:59:20,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 436 flow [2023-08-04 03:59:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:59:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:59:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2023-08-04 03:59:20,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2023-08-04 03:59:20,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 858 transitions. [2023-08-04 03:59:20,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 858 transitions. [2023-08-04 03:59:20,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:20,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 858 transitions. [2023-08-04 03:59:20,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states 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:20,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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:20,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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:20,299 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 214 flow. Second operand 3 states and 858 transitions. [2023-08-04 03:59:20,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 436 flow [2023-08-04 03:59:20,300 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:59:20,394 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 222 flow [2023-08-04 03:59:20,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:59:20,395 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-08-04 03:59:20,395 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 222 flow [2023-08-04 03:59:20,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states 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:20,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:20,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:20,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-04 03:59:20,595 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:59:20,596 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:59:20,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1622301242, now seen corresponding path program 1 times [2023-08-04 03:59:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107881784] [2023-08-04 03:59:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:20,640 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:59:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107881784] [2023-08-04 03:59:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107881784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476739881] [2023-08-04 03:59:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:20,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:20,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:20,642 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:59:20,643 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:59:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:20,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:59:20,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:20,735 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:59:20,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:20,745 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:59:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476739881] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:20,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:59:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745266000] [2023-08-04 03:59:20,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:20,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:59:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:59:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:59:20,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 560 [2023-08-04 03:59:20,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 256.14285714285717) internal successors, (1793), 7 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states 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:20,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:20,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 560 [2023-08-04 03:59:20,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:22,520 INFO L124 PetriNetUnfolderBase]: 20049/30556 cut-off events. [2023-08-04 03:59:22,520 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2023-08-04 03:59:22,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59459 conditions, 30556 events. 20049/30556 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 209547 event pairs, 17166 based on Foata normal form. 3/25146 useless extension candidates. Maximal degree in co-relation 59431. Up to 28195 conditions per place. [2023-08-04 03:59:22,650 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-04 03:59:22,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 392 flow [2023-08-04 03:59:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:59:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:59:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1605 transitions. [2023-08-04 03:59:22,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-08-04 03:59:22,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1605 transitions. [2023-08-04 03:59:22,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1605 transitions. [2023-08-04 03:59:22,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:22,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1605 transitions. [2023-08-04 03:59:22,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states 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:22,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:22,658 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:22,658 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 222 flow. Second operand 6 states and 1605 transitions. [2023-08-04 03:59:22,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 392 flow [2023-08-04 03:59:22,659 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:59:22,660 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 256 flow [2023-08-04 03:59:22,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:59:22,660 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2023-08-04 03:59:22,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 256 flow [2023-08-04 03:59:22,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 256.14285714285717) internal successors, (1793), 7 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states 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:22,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:22,661 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:22,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-04 03:59:22,865 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:59:22,866 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:59:22,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1803240359, now seen corresponding path program 2 times [2023-08-04 03:59:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406413747] [2023-08-04 03:59:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:22,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:22,932 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:59:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406413747] [2023-08-04 03:59:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406413747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941961237] [2023-08-04 03:59:22,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:59:22,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:22,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:22,937 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:59:22,940 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:59:23,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:59:23,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:59:23,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:59:23,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:23,048 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:59:23,087 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:59:23,088 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:59:23,118 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:59:23,158 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:59:23,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:59:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941961237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:59:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:59:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438043473] [2023-08-04 03:59:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:23,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:59:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:59:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:59:23,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 560 [2023-08-04 03:59:23,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states 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:23,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:23,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 560 [2023-08-04 03:59:23,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:25,990 INFO L124 PetriNetUnfolderBase]: 25507/39740 cut-off events. [2023-08-04 03:59:25,990 INFO L125 PetriNetUnfolderBase]: For 1007/1007 co-relation queries the response was YES. [2023-08-04 03:59:26,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77831 conditions, 39740 events. 25507/39740 cut-off events. For 1007/1007 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 295299 event pairs, 3964 based on Foata normal form. 0/32642 useless extension candidates. Maximal degree in co-relation 77795. Up to 28026 conditions per place. [2023-08-04 03:59:26,164 INFO L140 encePairwiseOnDemand]: 550/560 looper letters, 193 selfloop transitions, 16 changer transitions 0/227 dead transitions. [2023-08-04 03:59:26,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 227 transitions, 968 flow [2023-08-04 03:59:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:59:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:59:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1658 transitions. [2023-08-04 03:59:26,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493452380952381 [2023-08-04 03:59:26,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1658 transitions. [2023-08-04 03:59:26,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1658 transitions. [2023-08-04 03:59:26,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:26,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1658 transitions. [2023-08-04 03:59:26,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states 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:26,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:26,170 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:26,170 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 256 flow. Second operand 6 states and 1658 transitions. [2023-08-04 03:59:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 227 transitions, 968 flow [2023-08-04 03:59:26,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 227 transitions, 954 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:59:26,174 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 345 flow [2023-08-04 03:59:26,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:59:26,175 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2023-08-04 03:59:26,175 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 345 flow [2023-08-04 03:59:26,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states 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:26,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:26,175 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:26,183 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:59:26,380 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:59:26,381 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:59:26,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1035869640, now seen corresponding path program 1 times [2023-08-04 03:59:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573688206] [2023-08-04 03:59:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:26,419 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:59:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573688206] [2023-08-04 03:59:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573688206] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505738483] [2023-08-04 03:59:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:26,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:26,421 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:59:26,431 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:59:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:26,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:59:26,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:26,553 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:59:26,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:26,597 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:59:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505738483] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:26,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:59:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036346967] [2023-08-04 03:59:26,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:26,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:59:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:59:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:59:26,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 560 [2023-08-04 03:59:26,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 251.92857142857142) internal successors, (3527), 14 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states 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:26,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:26,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 560 [2023-08-04 03:59:26,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:29,422 INFO L124 PetriNetUnfolderBase]: 25466/39971 cut-off events. [2023-08-04 03:59:29,423 INFO L125 PetriNetUnfolderBase]: For 7968/7972 co-relation queries the response was YES. [2023-08-04 03:59:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85431 conditions, 39971 events. 25466/39971 cut-off events. For 7968/7972 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 301197 event pairs, 1096 based on Foata normal form. 32/35261 useless extension candidates. Maximal degree in co-relation 85372. Up to 34783 conditions per place. [2023-08-04 03:59:29,621 INFO L140 encePairwiseOnDemand]: 554/560 looper letters, 141 selfloop transitions, 15 changer transitions 0/174 dead transitions. [2023-08-04 03:59:29,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 849 flow [2023-08-04 03:59:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:59:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:59:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3643 transitions. [2023-08-04 03:59:29,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646683673469388 [2023-08-04 03:59:29,624 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3643 transitions. [2023-08-04 03:59:29,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3643 transitions. [2023-08-04 03:59:29,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:29,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3643 transitions. [2023-08-04 03:59:29,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 260.2142857142857) internal successors, (3643), 14 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states 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:29,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 560.0) internal successors, (8400), 15 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states 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:29,631 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 560.0) internal successors, (8400), 15 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states 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:29,631 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 345 flow. Second operand 14 states and 3643 transitions. [2023-08-04 03:59:29,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 849 flow [2023-08-04 03:59:29,639 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:59:29,641 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 427 flow [2023-08-04 03:59:29,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:59:29,641 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 35 predicate places. [2023-08-04 03:59:29,641 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 427 flow [2023-08-04 03:59:29,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 251.92857142857142) internal successors, (3527), 14 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states 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:29,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:29,642 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:29,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 03:59:29,842 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:59:29,842 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:59:29,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 111083739, now seen corresponding path program 1 times [2023-08-04 03:59:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435903450] [2023-08-04 03:59:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:29,997 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:29,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:29,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435903450] [2023-08-04 03:59:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435903450] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:29,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38541545] [2023-08-04 03:59:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:30,000 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:59:30,003 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:59:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:30,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 03:59:30,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:30,130 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:59:30,185 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:59:30,186 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:59:30,203 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:59:30,232 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:59:30,273 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:30,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:36,305 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (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_807) |c_~#cache~0.base|))) is different from false [2023-08-04 03:59:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:59:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38541545] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:36,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-04 03:59:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471450097] [2023-08-04 03:59:36,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:36,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 03:59:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 03:59:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=79, Unknown=3, NotChecked=18, Total=132 [2023-08-04 03:59:36,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 560 [2023-08-04 03:59:36,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 427 flow. Second operand has 12 states, 12 states have (on average 211.91666666666666) internal successors, (2543), 12 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states 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:36,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:36,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 560 [2023-08-04 03:59:36,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:40,116 INFO L124 PetriNetUnfolderBase]: 32541/49885 cut-off events. [2023-08-04 03:59:40,116 INFO L125 PetriNetUnfolderBase]: For 14924/14928 co-relation queries the response was YES. [2023-08-04 03:59:40,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110153 conditions, 49885 events. 32541/49885 cut-off events. For 14924/14928 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 370491 event pairs, 4806 based on Foata normal form. 4/43996 useless extension candidates. Maximal degree in co-relation 110079. Up to 30239 conditions per place. [2023-08-04 03:59:40,442 INFO L140 encePairwiseOnDemand]: 546/560 looper letters, 253 selfloop transitions, 33 changer transitions 0/302 dead transitions. [2023-08-04 03:59:40,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 302 transitions, 1509 flow [2023-08-04 03:59:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 03:59:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 03:59:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1725 transitions. [2023-08-04 03:59:40,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44005102040816324 [2023-08-04 03:59:40,444 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1725 transitions. [2023-08-04 03:59:40,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1725 transitions. [2023-08-04 03:59:40,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:40,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1725 transitions. [2023-08-04 03:59:40,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 246.42857142857142) internal successors, (1725), 7 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states 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:40,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states 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:40,449 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states 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:40,449 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 427 flow. Second operand 7 states and 1725 transitions. [2023-08-04 03:59:40,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 302 transitions, 1509 flow [2023-08-04 03:59:40,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 302 transitions, 1432 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-08-04 03:59:40,486 INFO L231 Difference]: Finished difference. Result has 124 places, 137 transitions, 589 flow [2023-08-04 03:59:40,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:59:40,488 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 37 predicate places. [2023-08-04 03:59:40,488 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 137 transitions, 589 flow [2023-08-04 03:59:40,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 211.91666666666666) internal successors, (2543), 12 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states 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:40,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:40,488 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:59:40,496 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:59:40,693 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:59:40,694 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:59:40,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash 530400722, now seen corresponding path program 1 times [2023-08-04 03:59:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222197551] [2023-08-04 03:59:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:40,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:41,009 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:59:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222197551] [2023-08-04 03:59:41,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222197551] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:59:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009509952] [2023-08-04 03:59:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:41,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:59:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:59:41,011 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:59:41,014 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:59:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:41,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 03:59:41,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:59:41,151 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:59:41,205 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:59:41,206 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:59:41,225 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:59:41,251 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:59:41,294 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:59:41,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:59:45,337 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (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_872) |c_~#cache~0.base|))) is different from false [2023-08-04 03:59:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-04 03:59:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009509952] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:59:45,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:59:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-04 03:59:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318645078] [2023-08-04 03:59:45,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:59:45,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 03:59:45,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 03:59:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=79, Unknown=3, NotChecked=18, Total=132 [2023-08-04 03:59:45,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 560 [2023-08-04 03:59:45,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 137 transitions, 589 flow. Second operand has 12 states, 12 states have (on average 212.08333333333334) internal successors, (2545), 12 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states 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:45,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:45,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 560 [2023-08-04 03:59:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:59:51,045 INFO L124 PetriNetUnfolderBase]: 47164/72703 cut-off events. [2023-08-04 03:59:51,046 INFO L125 PetriNetUnfolderBase]: For 45031/45034 co-relation queries the response was YES. [2023-08-04 03:59:51,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176847 conditions, 72703 events. 47164/72703 cut-off events. For 45031/45034 co-relation queries the response was YES. Maximal size of possible extension queue 1969. Compared 555552 event pairs, 9832 based on Foata normal form. 3/67171 useless extension candidates. Maximal degree in co-relation 167307. Up to 38353 conditions per place. [2023-08-04 03:59:51,504 INFO L140 encePairwiseOnDemand]: 548/560 looper letters, 270 selfloop transitions, 49 changer transitions 0/335 dead transitions. [2023-08-04 03:59:51,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 335 transitions, 1904 flow [2023-08-04 03:59:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 03:59:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 03:59:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1726 transitions. [2023-08-04 03:59:51,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403061224489796 [2023-08-04 03:59:51,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1726 transitions. [2023-08-04 03:59:51,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1726 transitions. [2023-08-04 03:59:51,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:59:51,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1726 transitions. [2023-08-04 03:59:51,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 246.57142857142858) internal successors, (1726), 7 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states 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,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states 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,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states 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,514 INFO L175 Difference]: Start difference. First operand has 124 places, 137 transitions, 589 flow. Second operand 7 states and 1726 transitions. [2023-08-04 03:59:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 335 transitions, 1904 flow [2023-08-04 03:59:51,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 335 transitions, 1904 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:59:51,626 INFO L231 Difference]: Finished difference. Result has 134 places, 164 transitions, 989 flow [2023-08-04 03:59:51,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:51,626 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 47 predicate places. [2023-08-04 03:59:51,626 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 164 transitions, 989 flow [2023-08-04 03:59:51,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 212.08333333333334) internal successors, (2545), 12 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states 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,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:59:51,627 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:51,631 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:51,827 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:51,828 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:51,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:59:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -438933267, now seen corresponding path program 1 times [2023-08-04 03:59:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:59:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847065804] [2023-08-04 03:59:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:59:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:59:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:59:51,976 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:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:59:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847065804] [2023-08-04 03:59:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847065804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:59:51,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:59:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:59:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895147487] [2023-08-04 03:59:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:59:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:59:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:59:51,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:59:51,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:59:52,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 560 [2023-08-04 03:59:52,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 164 transitions, 989 flow. Second operand has 5 states, 5 states have (on average 232.6) internal successors, (1163), 5 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states 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,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:59:52,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 560 [2023-08-04 03:59:52,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:01,972 INFO L124 PetriNetUnfolderBase]: 76409/120205 cut-off events. [2023-08-04 04:00:01,972 INFO L125 PetriNetUnfolderBase]: For 131003/131003 co-relation queries the response was YES. [2023-08-04 04:00:02,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318395 conditions, 120205 events. 76409/120205 cut-off events. For 131003/131003 co-relation queries the response was YES. Maximal size of possible extension queue 2498. Compared 1000093 event pairs, 21186 based on Foata normal form. 6964/120224 useless extension candidates. Maximal degree in co-relation 298490. Up to 67500 conditions per place. [2023-08-04 04:00:02,903 INFO L140 encePairwiseOnDemand]: 532/560 looper letters, 243 selfloop transitions, 28 changer transitions 0/284 dead transitions. [2023-08-04 04:00:02,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 284 transitions, 2339 flow [2023-08-04 04:00:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:00:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:00:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1070 transitions. [2023-08-04 04:00:02,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-08-04 04:00:02,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1070 transitions. [2023-08-04 04:00:02,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1070 transitions. [2023-08-04 04:00:02,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:02,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1070 transitions. [2023-08-04 04:00:02,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 267.5) internal successors, (1070), 4 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:02,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 560.0) internal successors, (2800), 5 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states 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:02,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 560.0) internal successors, (2800), 5 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states 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:02,909 INFO L175 Difference]: Start difference. First operand has 134 places, 164 transitions, 989 flow. Second operand 4 states and 1070 transitions. [2023-08-04 04:00:02,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 284 transitions, 2339 flow [2023-08-04 04:00:03,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 284 transitions, 2339 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:00:03,470 INFO L231 Difference]: Finished difference. Result has 138 places, 179 transitions, 1132 flow [2023-08-04 04:00:03,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1132, PETRI_PLACES=138, PETRI_TRANSITIONS=179} [2023-08-04 04:00:03,471 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 51 predicate places. [2023-08-04 04:00:03,471 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 179 transitions, 1132 flow [2023-08-04 04:00:03,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.6) internal successors, (1163), 5 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states 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:03,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:03,471 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:03,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-04 04:00:03,472 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 04:00:03,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1289506857, now seen corresponding path program 1 times [2023-08-04 04:00:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275094809] [2023-08-04 04:00:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:03,913 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:03,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:03,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275094809] [2023-08-04 04:00:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275094809] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:03,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926621934] [2023-08-04 04:00:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:03,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:03,917 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 04:00:03,964 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 04:00:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:04,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-04 04:00:04,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:04,171 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 04:00:04,230 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:00:04,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:00:04,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926621934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:00:04,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:00:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-08-04 04:00:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659383844] [2023-08-04 04:00:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:00:04,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:00:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:04,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:00:04,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-08-04 04:00:04,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 560 [2023-08-04 04:00:04,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 179 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states 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:04,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:04,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 560 [2023-08-04 04:00:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:27,160 INFO L124 PetriNetUnfolderBase]: 147218/235809 cut-off events. [2023-08-04 04:00:27,160 INFO L125 PetriNetUnfolderBase]: For 312162/312414 co-relation queries the response was YES. [2023-08-04 04:00:28,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724288 conditions, 235809 events. 147218/235809 cut-off events. For 312162/312414 co-relation queries the response was YES. Maximal size of possible extension queue 5647. Compared 2207778 event pairs, 52804 based on Foata normal form. 2644/221903 useless extension candidates. Maximal degree in co-relation 683545. Up to 104553 conditions per place. [2023-08-04 04:00:29,111 INFO L140 encePairwiseOnDemand]: 539/560 looper letters, 434 selfloop transitions, 42 changer transitions 0/494 dead transitions. [2023-08-04 04:00:29,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 494 transitions, 4154 flow [2023-08-04 04:00:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:00:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:00:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1652 transitions. [2023-08-04 04:00:29,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-08-04 04:00:29,114 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1652 transitions. [2023-08-04 04:00:29,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1652 transitions. [2023-08-04 04:00:29,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:29,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1652 transitions. [2023-08-04 04:00:29,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:29,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:29,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:29,119 INFO L175 Difference]: Start difference. First operand has 138 places, 179 transitions, 1132 flow. Second operand 6 states and 1652 transitions. [2023-08-04 04:00:29,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 494 transitions, 4154 flow [2023-08-04 04:00:30,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 494 transitions, 4153 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:00:30,241 INFO L231 Difference]: Finished difference. Result has 145 places, 217 transitions, 1555 flow [2023-08-04 04:00:30,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1555, PETRI_PLACES=145, PETRI_TRANSITIONS=217} [2023-08-04 04:00:30,242 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 58 predicate places. [2023-08-04 04:00:30,242 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 217 transitions, 1555 flow [2023-08-04 04:00:30,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states 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:30,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:30,243 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:30,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 04:00:30,443 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:30,443 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:30,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1202449935, now seen corresponding path program 2 times [2023-08-04 04:00:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961703140] [2023-08-04 04:00:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:30,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:30,702 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:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961703140] [2023-08-04 04:00:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961703140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:00:30,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:00:30,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 04:00:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626655987] [2023-08-04 04:00:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:00:30,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:00:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:30,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:00:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 04:00:30,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 560 [2023-08-04 04:00:30,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 217 transitions, 1555 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:30,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:30,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 560 [2023-08-04 04:00:30,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:23,059 INFO L124 PetriNetUnfolderBase]: 277751/447064 cut-off events. [2023-08-04 04:01:23,060 INFO L125 PetriNetUnfolderBase]: For 870440/871385 co-relation queries the response was YES. [2023-08-04 04:01:26,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552302 conditions, 447064 events. 277751/447064 cut-off events. For 870440/871385 co-relation queries the response was YES. Maximal size of possible extension queue 11252. Compared 4538839 event pairs, 103353 based on Foata normal form. 3565/417106 useless extension candidates. Maximal degree in co-relation 1452869. Up to 219205 conditions per place. [2023-08-04 04:01:29,387 INFO L140 encePairwiseOnDemand]: 540/560 looper letters, 491 selfloop transitions, 59 changer transitions 0/568 dead transitions. [2023-08-04 04:01:29,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 568 transitions, 5263 flow [2023-08-04 04:01:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:01:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:01:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2023-08-04 04:01:29,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-04 04:01:29,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1630 transitions. [2023-08-04 04:01:29,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1630 transitions. [2023-08-04 04:01:29,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:29,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1630 transitions. [2023-08-04 04:01:29,390 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:29,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:29,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:29,393 INFO L175 Difference]: Start difference. First operand has 145 places, 217 transitions, 1555 flow. Second operand 6 states and 1630 transitions. [2023-08-04 04:01:29,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 568 transitions, 5263 flow [2023-08-04 04:01:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 568 transitions, 5252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:01:32,343 INFO L231 Difference]: Finished difference. Result has 151 places, 271 transitions, 2312 flow [2023-08-04 04:01:32,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2312, PETRI_PLACES=151, PETRI_TRANSITIONS=271} [2023-08-04 04:01:32,344 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 64 predicate places. [2023-08-04 04:01:32,344 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 271 transitions, 2312 flow [2023-08-04 04:01:32,344 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:32,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:32,344 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:32,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-04 04:01:32,345 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:32,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 437328155, now seen corresponding path program 3 times [2023-08-04 04:01:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291332935] [2023-08-04 04:01:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:32,896 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:32,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:32,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291332935] [2023-08-04 04:01:32,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291332935] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:32,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186055522] [2023-08-04 04:01:32,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:01:32,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:32,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:32,900 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:01:32,901 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:01:33,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-04 04:01:33,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:01:33,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-04 04:01:33,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:33,130 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:33,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:33,165 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:33,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:33,189 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:33,231 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:33,231 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:01:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186055522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:01:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-04 04:01:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952379328] [2023-08-04 04:01:33,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:33,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:01:33,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:33,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:01:33,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-08-04 04:01:33,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 560 [2023-08-04 04:01:33,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 271 transitions, 2312 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states 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:33,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:33,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 560 [2023-08-04 04:01:33,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand