/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 12:47:04,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 12:47:04,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 12:47:04,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 12:47:04,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 12:47:04,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 12:47:04,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 12:47:04,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 12:47:04,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 12:47:04,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 12:47:04,831 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 12:47:04,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 12:47:04,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 12:47:04,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 12:47:04,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 12:47:04,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 12:47:04,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 12:47:04,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 12:47:04,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 12:47:04,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 12:47:04,839 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 12:47:04,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 12:47:04,840 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 12:47:04,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 12:47:04,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 12:47:04,842 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 12:47:04,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 12:47:04,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:47:04,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 12:47:04,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 12:47:04,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 12:47:04,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 12:47:04,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 12:47:04,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 12:47:04,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 12:47:04,844 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 12:47:05,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 12:47:05,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 12:47:05,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 12:47:05,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 12:47:05,163 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 12:47:05,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-24 12:47:06,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 12:47:06,665 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 12:47:06,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-24 12:47:06,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27bb5d54/d9428605db6449c7907b2a2182b2af1b/FLAG4eea42ea2 [2023-08-24 12:47:06,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27bb5d54/d9428605db6449c7907b2a2182b2af1b [2023-08-24 12:47:06,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 12:47:06,720 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 12:47:06,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 12:47:06,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 12:47:06,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 12:47:06,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:47:06" (1/1) ... [2023-08-24 12:47:06,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1971af1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:06, skipping insertion in model container [2023-08-24 12:47:06,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:47:06" (1/1) ... [2023-08-24 12:47:06,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 12:47:07,185 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2023-08-24 12:47:07,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:47:07,231 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 12:47:07,244 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:47:07,246 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:47:07,254 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-24 12:47:07,260 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2023-08-24 12:47:07,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:47:07,328 INFO L206 MainTranslator]: Completed translation [2023-08-24 12:47:07,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07 WrapperNode [2023-08-24 12:47:07,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 12:47:07,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 12:47:07,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 12:47:07,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 12:47:07,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,396 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 253 [2023-08-24 12:47:07,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 12:47:07,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 12:47:07,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 12:47:07,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 12:47:07,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 12:47:07,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 12:47:07,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 12:47:07,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 12:47:07,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (1/1) ... [2023-08-24 12:47:07,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:47:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:07,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 12:47:07,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 12:47:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 12:47:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 12:47:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 12:47:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 12:47:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 12:47:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 12:47:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-24 12:47:07,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-24 12:47:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 12:47:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 12:47:07,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 12:47:07,501 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 12:47:07,645 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 12:47:07,647 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 12:47:08,066 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 12:47:08,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 12:47:08,076 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-24 12:47:08,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:47:08 BoogieIcfgContainer [2023-08-24 12:47:08,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 12:47:08,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 12:47:08,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 12:47:08,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 12:47:08,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:47:06" (1/3) ... [2023-08-24 12:47:08,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5d5515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:47:08, skipping insertion in model container [2023-08-24 12:47:08,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:47:07" (2/3) ... [2023-08-24 12:47:08,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5d5515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:47:08, skipping insertion in model container [2023-08-24 12:47:08,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:47:08" (3/3) ... [2023-08-24 12:47:08,086 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-08-24 12:47:08,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 12:47:08,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-24 12:47:08,102 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 12:47:08,163 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-24 12:47:08,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 249 transitions, 506 flow [2023-08-24 12:47:08,313 INFO L124 PetriNetUnfolderBase]: 73/386 cut-off events. [2023-08-24 12:47:08,313 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 12:47:08,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 386 events. 73/386 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1717 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 211. Up to 8 conditions per place. [2023-08-24 12:47:08,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 249 transitions, 506 flow [2023-08-24 12:47:08,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 244 transitions, 493 flow [2023-08-24 12:47:08,347 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:47:08,358 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 244 transitions, 493 flow [2023-08-24 12:47:08,362 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 244 transitions, 493 flow [2023-08-24 12:47:08,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 244 transitions, 493 flow [2023-08-24 12:47:08,433 INFO L124 PetriNetUnfolderBase]: 72/381 cut-off events. [2023-08-24 12:47:08,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:08,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 381 events. 72/381 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1675 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 211. Up to 8 conditions per place. [2023-08-24 12:47:08,450 INFO L119 LiptonReduction]: Number of co-enabled transitions 19734 [2023-08-24 12:47:11,607 INFO L134 LiptonReduction]: Checked pairs total: 31732 [2023-08-24 12:47:11,608 INFO L136 LiptonReduction]: Total number of compositions: 188 [2023-08-24 12:47:11,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:47:11,625 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a41cfa7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:47:11,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 12:47:11,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:47:11,630 INFO L124 PetriNetUnfolderBase]: 12/43 cut-off events. [2023-08-24 12:47:11,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:11,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:11,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:11,631 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-24 12:47:11,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -351581278, now seen corresponding path program 1 times [2023-08-24 12:47:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810552546] [2023-08-24 12:47:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810552546] [2023-08-24 12:47:11,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810552546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:11,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:47:11,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:47:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912909965] [2023-08-24 12:47:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:11,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:47:11,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 437 [2023-08-24 12:47:11,861 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.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:11,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:11,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 437 [2023-08-24 12:47:11,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:12,066 INFO L124 PetriNetUnfolderBase]: 579/1212 cut-off events. [2023-08-24 12:47:12,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:12,067 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 6870 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-24 12:47:12,072 INFO L140 encePairwiseOnDemand]: 402/437 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-24 12:47:12,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-24 12:47:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2023-08-24 12:47:12,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186880244088482 [2023-08-24 12:47:12,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2023-08-24 12:47:12,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2023-08-24 12:47:12,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:12,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2023-08-24 12:47:12,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 437.0) internal successors, (1748), 4 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 437.0) internal successors, (1748), 4 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,111 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 680 transitions. [2023-08-24 12:47:12,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-24 12:47:12,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:12,118 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 147 flow [2023-08-24 12:47:12,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, 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-24 12:47:12,124 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-24 12:47:12,124 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 147 flow [2023-08-24 12:47:12,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:12,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:12,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 12:47:12,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:12,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1272872607, now seen corresponding path program 1 times [2023-08-24 12:47:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948887159] [2023-08-24 12:47:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948887159] [2023-08-24 12:47:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948887159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222192512] [2023-08-24 12:47:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:12,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 12:47:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:12,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:47:12,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:12,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222192512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:47:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306328333] [2023-08-24 12:47:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:12,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:47:12,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 437 [2023-08-24 12:47:12,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:12,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 437 [2023-08-24 12:47:12,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:12,483 INFO L124 PetriNetUnfolderBase]: 576/1169 cut-off events. [2023-08-24 12:47:12,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:12,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 1169 events. 576/1169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6518 event pairs, 300 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 2205. Up to 1012 conditions per place. [2023-08-24 12:47:12,490 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-24 12:47:12,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 321 flow [2023-08-24 12:47:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2023-08-24 12:47:12,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064836003051106 [2023-08-24 12:47:12,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2023-08-24 12:47:12,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2023-08-24 12:47:12,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:12,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2023-08-24 12:47:12,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 437.0) internal successors, (1748), 4 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 437.0) internal successors, (1748), 4 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,499 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 147 flow. Second operand 3 states and 664 transitions. [2023-08-24 12:47:12,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 321 flow [2023-08-24 12:47:12,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:12,502 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 151 flow [2023-08-24 12:47:12,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, 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-24 12:47:12,503 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2023-08-24 12:47:12,503 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 151 flow [2023-08-24 12:47:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:12,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:12,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:12,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:12,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:12,710 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-24 12:47:12,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 181206654, now seen corresponding path program 1 times [2023-08-24 12:47:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299461565] [2023-08-24 12:47:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299461565] [2023-08-24 12:47:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299461565] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396418071] [2023-08-24 12:47:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:12,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:12,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:12,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:12,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 12:47:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:12,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:47:12,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:12,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396418071] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:12,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:12,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:47:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707889434] [2023-08-24 12:47:12,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:47:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:47:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:47:12,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 437 [2023-08-24 12:47:12,933 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-24 12:47:12,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:12,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 437 [2023-08-24 12:47:12,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:13,098 INFO L124 PetriNetUnfolderBase]: 576/1192 cut-off events. [2023-08-24 12:47:13,098 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-24 12:47:13,101 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 65. Compared 6691 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-24 12:47:13,105 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-24 12:47:13,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 275 flow [2023-08-24 12:47:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1247 transitions. [2023-08-24 12:47:13,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4755911517925248 [2023-08-24 12:47:13,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1247 transitions. [2023-08-24 12:47:13,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1247 transitions. [2023-08-24 12:47:13,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:13,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1247 transitions. [2023-08-24 12:47:13,112 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-24 12:47:13,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 437.0) internal successors, (3059), 7 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:13,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 437.0) internal successors, (3059), 7 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:13,118 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 151 flow. Second operand 6 states and 1247 transitions. [2023-08-24 12:47:13,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 275 flow [2023-08-24 12:47:13,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 12:47:13,121 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 183 flow [2023-08-24 12:47:13,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, 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-24 12:47:13,122 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-08-24 12:47:13,122 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 183 flow [2023-08-24 12:47:13,123 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-24 12:47:13,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:13,123 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:13,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:13,329 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,SelfDestructingSolverStorable2 [2023-08-24 12:47:13,329 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-24 12:47:13,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1731534337, now seen corresponding path program 2 times [2023-08-24 12:47:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577533929] [2023-08-24 12:47:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:13,451 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-24 12:47:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577533929] [2023-08-24 12:47:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577533929] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880008226] [2023-08-24 12:47:13,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:47:13,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:13,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 12:47:13,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:47:13,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:47:13,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-24 12:47:13,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:13,568 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-24 12:47:13,620 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:47:13,620 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-24 12:47:13,665 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-24 12:47:13,712 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-24 12:47:13,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880008226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:47:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736947497] [2023-08-24 12:47:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:47:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:47:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:47:13,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 437 [2023-08-24 12:47:13,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:13,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:13,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 437 [2023-08-24 12:47:13,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:14,007 INFO L124 PetriNetUnfolderBase]: 878/1803 cut-off events. [2023-08-24 12:47:14,007 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-24 12:47:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3526 conditions, 1803 events. 878/1803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10765 event pairs, 120 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 3491. Up to 1127 conditions per place. [2023-08-24 12:47:14,016 INFO L140 encePairwiseOnDemand]: 429/437 looper letters, 109 selfloop transitions, 8 changer transitions 0/128 dead transitions. [2023-08-24 12:47:14,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 541 flow [2023-08-24 12:47:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:47:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:47:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 926 transitions. [2023-08-24 12:47:14,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4237986270022883 [2023-08-24 12:47:14,020 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 926 transitions. [2023-08-24 12:47:14,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 926 transitions. [2023-08-24 12:47:14,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:14,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 926 transitions. [2023-08-24 12:47:14,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.2) internal successors, (926), 5 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,027 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 183 flow. Second operand 5 states and 926 transitions. [2023-08-24 12:47:14,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 541 flow [2023-08-24 12:47:14,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 527 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:14,031 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 219 flow [2023-08-24 12:47:14,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, 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-24 12:47:14,032 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-08-24 12:47:14,032 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 219 flow [2023-08-24 12:47:14,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:14,033 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:14,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:14,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:14,239 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-24 12:47:14,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1685130464, now seen corresponding path program 1 times [2023-08-24 12:47:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:14,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390489502] [2023-08-24 12:47:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:14,286 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-24 12:47:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390489502] [2023-08-24 12:47:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390489502] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:14,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394431269] [2023-08-24 12:47:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:14,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:14,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:14,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 12:47:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:14,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:47:14,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:14,411 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-24 12:47:14,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:14,469 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-24 12:47:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394431269] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:14,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-24 12:47:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996237101] [2023-08-24 12:47:14,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:14,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 12:47:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 12:47:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:47:14,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 437 [2023-08-24 12:47:14,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 219 flow. Second operand has 14 states, 14 states have (on average 192.92857142857142) internal successors, (2701), 14 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:14,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 437 [2023-08-24 12:47:14,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:14,561 INFO L124 PetriNetUnfolderBase]: 60/171 cut-off events. [2023-08-24 12:47:14,562 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-08-24 12:47:14,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 171 events. 60/171 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 478 event pairs, 16 based on Foata normal form. 32/197 useless extension candidates. Maximal degree in co-relation 365. Up to 108 conditions per place. [2023-08-24 12:47:14,563 INFO L140 encePairwiseOnDemand]: 432/437 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-08-24 12:47:14,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 306 flow [2023-08-24 12:47:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:47:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:47:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2730 transitions. [2023-08-24 12:47:14,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462242562929062 [2023-08-24 12:47:14,570 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2730 transitions. [2023-08-24 12:47:14,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2730 transitions. [2023-08-24 12:47:14,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:14,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2730 transitions. [2023-08-24 12:47:14,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 437.0) internal successors, (6555), 15 states have internal predecessors, (6555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,589 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 437.0) internal successors, (6555), 15 states have internal predecessors, (6555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,589 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 219 flow. Second operand 14 states and 2730 transitions. [2023-08-24 12:47:14,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 306 flow [2023-08-24 12:47:14,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 12:47:14,593 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-08-24 12:47:14,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, 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-24 12:47:14,593 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-08-24 12:47:14,593 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-08-24 12:47:14,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 192.92857142857142) internal successors, (2701), 14 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:14,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:14,595 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-24 12:47:14,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:14,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:14,801 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-24 12:47:14,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1879679671, now seen corresponding path program 1 times [2023-08-24 12:47:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678012672] [2023-08-24 12:47:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:15,821 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-24 12:47:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678012672] [2023-08-24 12:47:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678012672] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586678553] [2023-08-24 12:47:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:15,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:15,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:15,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 12:47:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:15,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 12:47:15,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:15,948 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-24 12:47:16,032 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:47:16,034 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-24 12:47:16,062 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-24 12:47:16,163 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-24 12:47:16,227 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-24 12:47:16,288 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-24 12:47:16,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:24,372 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (= (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_59|) 0)) is different from false [2023-08-24 12:47:26,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 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_59|) 0)) is different from false [2023-08-24 12:47:28,390 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (= (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_59|) 0)) is different from false [2023-08-24 12:47:36,452 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_209 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_209) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-24 12:47:36,548 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-24 12:47:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586678553] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:36,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-24 12:47:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453584366] [2023-08-24 12:47:36,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:36,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 12:47:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:36,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 12:47:36,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=6, NotChecked=164, Total=600 [2023-08-24 12:47:36,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 437 [2023-08-24 12:47:36,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 169 flow. Second operand has 25 states, 25 states have (on average 148.4) internal successors, (3710), 25 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:36,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:36,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 437 [2023-08-24 12:47:36,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:42,868 WARN L234 SmtUtils]: Spent 6.06s 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-24 12:47:48,927 WARN L234 SmtUtils]: Spent 6.04s 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-24 12:48:09,070 WARN L234 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-24 12:48:11,121 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-24 12:48:13,124 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-24 12:48:15,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:48:17,137 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-24 12:48:19,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:48:21,147 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-24 12:48:23,150 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-24 12:48:25,153 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-24 12:48:27,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:48:29,162 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-24 12:48:31,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:48:33,179 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-24 12:48:35,184 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-24 12:48:37,186 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-24 12:48:39,193 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-24 12:48:46,746 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-24 12:48:48,759 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-24 12:48:50,762 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-24 12:48:52,772 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-24 12:48:54,775 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-24 12:48:56,783 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-24 12:48:58,793 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-24 12:49:00,795 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-24 12:49:02,823 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-24 12:49:04,825 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-24 12:49:06,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:08,843 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-24 12:49:10,851 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-24 12:49:12,853 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-24 12:49:14,856 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-24 12:49:23,112 WARN L234 SmtUtils]: Spent 8.04s 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-24 12:49:23,206 INFO L124 PetriNetUnfolderBase]: 60/193 cut-off events. [2023-08-24 12:49:23,206 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-24 12:49:23,207 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 553 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-24 12:49:23,208 INFO L140 encePairwiseOnDemand]: 426/437 looper letters, 59 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2023-08-24 12:49:23,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 497 flow [2023-08-24 12:49:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 12:49:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 12:49:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2564 transitions. [2023-08-24 12:49:23,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34513393458069724 [2023-08-24 12:49:23,215 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2564 transitions. [2023-08-24 12:49:23,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2564 transitions. [2023-08-24 12:49:23,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:49:23,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2564 transitions. [2023-08-24 12:49:23,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 150.8235294117647) internal successors, (2564), 17 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:23,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 437.0) internal successors, (7866), 18 states have internal predecessors, (7866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:23,232 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 437.0) internal successors, (7866), 18 states have internal predecessors, (7866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:23,232 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 169 flow. Second operand 17 states and 2564 transitions. [2023-08-24 12:49:23,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 497 flow [2023-08-24 12:49:23,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 423 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-24 12:49:23,235 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 265 flow [2023-08-24 12:49:23,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, 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-24 12:49:23,236 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-08-24 12:49:23,236 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 265 flow [2023-08-24 12:49:23,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 148.4) internal successors, (3710), 25 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:23,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:49:23,237 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-24 12:49:23,247 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-24 12:49:23,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:23,444 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-24 12:49:23,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:49:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1210695182, now seen corresponding path program 1 times [2023-08-24 12:49:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:49:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294027355] [2023-08-24 12:49:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:49:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:24,756 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-24 12:49:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:49:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294027355] [2023-08-24 12:49:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294027355] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:49:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758172543] [2023-08-24 12:49:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:49:24,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:49:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:49:24,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:49:24,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 12:49:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:49:24,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-24 12:49:24,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:49:24,877 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-24 12:49:24,949 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:49:24,950 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-24 12:49:24,972 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-24 12:49:25,093 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-24 12:49:25,149 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-24 12:49:25,215 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-24 12:49:25,286 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-24 12:49:25,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:49:45,364 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (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_63|) 0)) is different from false [2023-08-24 12:49:47,369 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 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_63|) 0)) is different from false [2023-08-24 12:49:47,377 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_312 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312))) (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_63|) 0)) is different from false [2023-08-24 12:49:47,395 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_312 (Array Int Int))) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312))) (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_63|) 0)) is different from false [2023-08-24 12:49:47,406 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_312 (Array Int Int))) (= (select (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_312))) (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_63|) 0)) is different from false [2023-08-24 12:49:59,608 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_312 (Array Int Int))) (= (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_309))) (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_312) |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_63|) 0)) is different from false [2023-08-24 12:49:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:49:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758172543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:49:59,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:49:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 29 [2023-08-24 12:49:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12149602] [2023-08-24 12:49:59,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:49:59,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 12:49:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:49:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 12:49:59,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=24, NotChecked=306, Total=930 [2023-08-24 12:49:59,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 437 [2023-08-24 12:49:59,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 265 flow. Second operand has 31 states, 31 states have (on average 148.1290322580645) internal successors, (4592), 31 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:49:59,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:49:59,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 437 [2023-08-24 12:49:59,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:50:09,035 WARN L234 SmtUtils]: Spent 8.85s on a formula simplification. DAG size of input: 69 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:50:18,852 WARN L234 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 71 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:50:30,901 WARN L234 SmtUtils]: Spent 11.89s on a formula simplification. DAG size of input: 64 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:50:56,171 WARN L234 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 59 DAG size of output: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:51:14,026 WARN L234 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 32 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:51:31,076 INFO L124 PetriNetUnfolderBase]: 98/297 cut-off events. [2023-08-24 12:51:31,076 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2023-08-24 12:51:31,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 297 events. 98/297 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1077 event pairs, 7 based on Foata normal form. 2/289 useless extension candidates. Maximal degree in co-relation 781. Up to 53 conditions per place. [2023-08-24 12:51:31,077 INFO L140 encePairwiseOnDemand]: 425/437 looper letters, 0 selfloop transitions, 0 changer transitions 149/149 dead transitions. [2023-08-24 12:51:31,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 149 transitions, 894 flow [2023-08-24 12:51:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 12:51:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 12:51:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4787 transitions. [2023-08-24 12:51:31,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34231979405034324 [2023-08-24 12:51:31,090 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4787 transitions. [2023-08-24 12:51:31,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4787 transitions. [2023-08-24 12:51:31,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:51:31,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4787 transitions. [2023-08-24 12:51:31,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 149.59375) internal successors, (4787), 32 states have internal predecessors, (4787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:31,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 437.0) internal successors, (14421), 33 states have internal predecessors, (14421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:31,122 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 437.0) internal successors, (14421), 33 states have internal predecessors, (14421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:31,122 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 265 flow. Second operand 32 states and 4787 transitions. [2023-08-24 12:51:31,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 149 transitions, 894 flow [2023-08-24 12:51:31,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 149 transitions, 842 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-24 12:51:31,126 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2023-08-24 12:51:31,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2023-08-24 12:51:31,126 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 24 predicate places. [2023-08-24 12:51:31,127 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2023-08-24 12:51:31,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 148.1290322580645) internal successors, (4592), 31 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:51:31,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 12:51:31,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 12:51:31,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 12:51:31,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 12:51:31,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 12:51:31,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:51:31,337 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-24 12:51:31,338 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 12:51:31,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 249 transitions, 506 flow [2023-08-24 12:51:31,370 INFO L124 PetriNetUnfolderBase]: 73/386 cut-off events. [2023-08-24 12:51:31,370 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 12:51:31,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 386 events. 73/386 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1717 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 211. Up to 8 conditions per place. [2023-08-24 12:51:31,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 249 transitions, 506 flow [2023-08-24 12:51:31,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 244 transitions, 493 flow [2023-08-24 12:51:31,375 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:51:31,375 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 244 transitions, 493 flow [2023-08-24 12:51:31,375 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 244 transitions, 493 flow [2023-08-24 12:51:31,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 244 transitions, 493 flow [2023-08-24 12:51:31,399 INFO L124 PetriNetUnfolderBase]: 72/381 cut-off events. [2023-08-24 12:51:31,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:51:31,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 381 events. 72/381 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1675 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 211. Up to 8 conditions per place. [2023-08-24 12:51:31,409 INFO L119 LiptonReduction]: Number of co-enabled transitions 19734 [2023-08-24 12:52:01,487 INFO L134 LiptonReduction]: Checked pairs total: 31788 [2023-08-24 12:52:01,487 INFO L136 LiptonReduction]: Total number of compositions: 189 [2023-08-24 12:52:01,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 12:52:01,489 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a41cfa7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:52:01,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 12:52:01,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:52:01,492 INFO L124 PetriNetUnfolderBase]: 14/47 cut-off events. [2023-08-24 12:52:01,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:52:01,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:01,492 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-24 12:52:01,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:52:01,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1995612889, now seen corresponding path program 1 times [2023-08-24 12:52:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520722249] [2023-08-24 12:52:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:52:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520722249] [2023-08-24 12:52:01,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520722249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:52:01,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:52:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:52:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525757203] [2023-08-24 12:52:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:52:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:52:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:52:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:52:01,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 438 [2023-08-24 12:52:01,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:01,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:01,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 438 [2023-08-24 12:52:01,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:02,478 INFO L124 PetriNetUnfolderBase]: 579/1211 cut-off events. [2023-08-24 12:52:02,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:52:02,480 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 6866 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-24 12:52:02,481 INFO L140 encePairwiseOnDemand]: 403/438 looper letters, 22 selfloop transitions, 2 changer transitions 37/66 dead transitions. [2023-08-24 12:52:02,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-24 12:52:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:52:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:52:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2023-08-24 12:52:02,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517503805175038 [2023-08-24 12:52:02,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2023-08-24 12:52:02,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2023-08-24 12:52:02,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:02,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2023-08-24 12:52:02,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:02,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:02,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:02,488 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 680 transitions. [2023-08-24 12:52:02,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-24 12:52:02,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:52:02,489 INFO L231 Difference]: Finished difference. Result has 65 places, 29 transitions, 73 flow [2023-08-24 12:52:02,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, 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-24 12:52:02,490 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-24 12:52:02,490 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 29 transitions, 73 flow [2023-08-24 12:52:02,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:02,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:02,490 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:02,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 12:52:02,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:52:02,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1061738344, now seen corresponding path program 1 times [2023-08-24 12:52:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436798970] [2023-08-24 12:52:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:02,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:52:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436798970] [2023-08-24 12:52:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436798970] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339036337] [2023-08-24 12:52:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:02,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:02,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:02,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 12:52:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:02,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:52:02,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:52:02,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:52:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339036337] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:02,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:52:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239151450] [2023-08-24 12:52:02,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:52:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:52:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:52:02,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 438 [2023-08-24 12:52:02,968 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-24 12:52:02,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:02,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 438 [2023-08-24 12:52:02,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:03,337 INFO L124 PetriNetUnfolderBase]: 54/139 cut-off events. [2023-08-24 12:52:03,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:52:03,338 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-24 12:52:03,338 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 22 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-08-24 12:52:03,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 139 flow [2023-08-24 12:52:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:52:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:52:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1218 transitions. [2023-08-24 12:52:03,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634703196347032 [2023-08-24 12:52:03,341 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1218 transitions. [2023-08-24 12:52:03,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1218 transitions. [2023-08-24 12:52:03,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:03,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1218 transitions. [2023-08-24 12:52:03,344 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-24 12:52:03,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:03,348 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:03,348 INFO L175 Difference]: Start difference. First operand has 65 places, 29 transitions, 73 flow. Second operand 6 states and 1218 transitions. [2023-08-24 12:52:03,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 139 flow [2023-08-24 12:52:03,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 135 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:52:03,349 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-08-24 12:52:03,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, 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-24 12:52:03,349 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-08-24 12:52:03,349 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-08-24 12:52:03,350 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-24 12:52:03,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:03,350 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-24 12:52:03,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:03,554 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-24 12:52:03,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:52:03,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -182268263, now seen corresponding path program 2 times [2023-08-24 12:52:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:03,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20946531] [2023-08-24 12:52:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:03,935 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-24 12:52:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20946531] [2023-08-24 12:52:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20946531] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753994695] [2023-08-24 12:52:03,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:52:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:03,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:03,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:03,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 12:52:04,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:52:04,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:04,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:52:04,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:04,164 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-24 12:52:04,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:04,647 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-24 12:52:04,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753994695] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:04,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:04,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:52:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281382200] [2023-08-24 12:52:04,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:04,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:52:04,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:52:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:52:04,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 438 [2023-08-24 12:52:04,651 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-24 12:52:04,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:04,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 438 [2023-08-24 12:52:04,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:05,351 INFO L124 PetriNetUnfolderBase]: 54/145 cut-off events. [2023-08-24 12:52:05,351 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 12:52:05,352 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 376 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-24 12:52:05,352 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 22 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-24 12:52:05,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 207 flow [2023-08-24 12:52:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:52:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:52:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2415 transitions. [2023-08-24 12:52:05,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594748858447489 [2023-08-24 12:52:05,358 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2415 transitions. [2023-08-24 12:52:05,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2415 transitions. [2023-08-24 12:52:05,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:05,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2415 transitions. [2023-08-24 12:52:05,363 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-24 12:52:05,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 438.0) internal successors, (5694), 13 states have internal predecessors, (5694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:05,369 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 438.0) internal successors, (5694), 13 states have internal predecessors, (5694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:05,370 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 2415 transitions. [2023-08-24 12:52:05,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 207 flow [2023-08-24 12:52:05,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 193 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:52:05,371 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-08-24 12:52:05,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, 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-24 12:52:05,372 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-08-24 12:52:05,372 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-08-24 12:52:05,372 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-24 12:52:05,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:05,373 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-24 12:52:05,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 12:52:05,582 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,SelfDestructingSolverStorable9 [2023-08-24 12:52:05,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:52:05,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1487025095, now seen corresponding path program 3 times [2023-08-24 12:52:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232277027] [2023-08-24 12:52:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:52:05,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 12:52:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:52:05,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 12:52:05,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 12:52:05,628 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 12:52:05,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 12:52:05,629 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-24 12:52:05,629 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 12:52:05,630 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 12:52:05,630 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 12:52:05,662 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 12:52:05,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 320 transitions, 658 flow [2023-08-24 12:52:05,713 INFO L124 PetriNetUnfolderBase]: 118/619 cut-off events. [2023-08-24 12:52:05,713 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 12:52:05,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 118/619 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3126 event pairs, 0 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 388. Up to 12 conditions per place. [2023-08-24 12:52:05,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 320 transitions, 658 flow [2023-08-24 12:52:05,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 320 transitions, 658 flow [2023-08-24 12:52:05,725 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:52:05,725 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 320 transitions, 658 flow [2023-08-24 12:52:05,725 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 320 transitions, 658 flow [2023-08-24 12:52:05,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 320 transitions, 658 flow [2023-08-24 12:52:05,777 INFO L124 PetriNetUnfolderBase]: 118/619 cut-off events. [2023-08-24 12:52:05,778 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 12:52:05,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 118/619 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3126 event pairs, 0 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 388. Up to 12 conditions per place. [2023-08-24 12:52:05,806 INFO L119 LiptonReduction]: Number of co-enabled transitions 50508 [2023-08-24 12:52:42,897 INFO L134 LiptonReduction]: Checked pairs total: 78898 [2023-08-24 12:52:42,897 INFO L136 LiptonReduction]: Total number of compositions: 245 [2023-08-24 12:52:42,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:52:42,899 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a41cfa7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:52:42,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 12:52:42,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:52:42,902 INFO L124 PetriNetUnfolderBase]: 9/40 cut-off events. [2023-08-24 12:52:42,902 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 12:52:42,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:42,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:42,902 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-24 12:52:42,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 864653924, now seen corresponding path program 1 times [2023-08-24 12:52:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59689975] [2023-08-24 12:52:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:52:42,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:42,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59689975] [2023-08-24 12:52:42,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59689975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:52:42,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:52:42,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:52:42,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543464845] [2023-08-24 12:52:42,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:52:42,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:52:42,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:52:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:52:42,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 565 [2023-08-24 12:52:42,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 133 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:42,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:42,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 565 [2023-08-24 12:52:42,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:45,952 INFO L124 PetriNetUnfolderBase]: 19961/30642 cut-off events. [2023-08-24 12:52:45,953 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-08-24 12:52:45,991 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 944. Compared 212660 event pairs, 17166 based on Foata normal form. 5462/30472 useless extension candidates. Maximal degree in co-relation 20159. Up to 28224 conditions per place. [2023-08-24 12:52:46,215 INFO L140 encePairwiseOnDemand]: 521/565 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-24 12:52:46,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 354 flow [2023-08-24 12:52:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:52:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:52:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2023-08-24 12:52:46,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185840707964602 [2023-08-24 12:52:46,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 879 transitions. [2023-08-24 12:52:46,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 879 transitions. [2023-08-24 12:52:46,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:46,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 879 transitions. [2023-08-24 12:52:46,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:46,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 565.0) internal successors, (2260), 4 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:46,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 565.0) internal successors, (2260), 4 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:46,224 INFO L175 Difference]: Start difference. First operand has 87 places, 133 transitions, 284 flow. Second operand 3 states and 879 transitions. [2023-08-24 12:52:46,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 354 flow [2023-08-24 12:52:46,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:52:46,226 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 214 flow [2023-08-24 12:52:46,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, 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-24 12:52:46,227 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2023-08-24 12:52:46,227 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 214 flow [2023-08-24 12:52:46,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:46,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:46,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:46,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 12:52:46,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:52:46,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash 858991534, now seen corresponding path program 1 times [2023-08-24 12:52:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680790172] [2023-08-24 12:52:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:52:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680790172] [2023-08-24 12:52:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680790172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807499271] [2023-08-24 12:52:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:46,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:46,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 12:52:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:46,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:52:46,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:52:46,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:52:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807499271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:52:46,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:52:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:52:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391588467] [2023-08-24 12:52:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:52:46,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:52:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:46,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:52:46,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:52:46,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 565 [2023-08-24 12:52:46,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:46,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:46,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 565 [2023-08-24 12:52:46,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:48,938 INFO L124 PetriNetUnfolderBase]: 19644/30266 cut-off events. [2023-08-24 12:52:48,938 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-24 12:52:48,986 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 945. Compared 212465 event pairs, 8256 based on Foata normal form. 0/24592 useless extension candidates. Maximal degree in co-relation 58576. Up to 28177 conditions per place. [2023-08-24 12:52:49,177 INFO L140 encePairwiseOnDemand]: 562/565 looper letters, 91 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-08-24 12:52:49,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 436 flow [2023-08-24 12:52:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:52:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:52:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2023-08-24 12:52:49,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504424778761062 [2023-08-24 12:52:49,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 855 transitions. [2023-08-24 12:52:49,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 855 transitions. [2023-08-24 12:52:49,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:49,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 855 transitions. [2023-08-24 12:52:49,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:49,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 565.0) internal successors, (2260), 4 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:49,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 565.0) internal successors, (2260), 4 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:49,184 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 214 flow. Second operand 3 states and 855 transitions. [2023-08-24 12:52:49,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 436 flow [2023-08-24 12:52:49,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 432 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:52:49,186 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 222 flow [2023-08-24 12:52:49,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, 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-24 12:52:49,187 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-08-24 12:52:49,187 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 222 flow [2023-08-24 12:52:49,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:49,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:49,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:49,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 12:52:49,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-24 12:52:49,392 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-24 12:52:49,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:49,393 INFO L85 PathProgramCache]: Analyzing trace with hash -107374600, now seen corresponding path program 1 times [2023-08-24 12:52:49,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:49,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044495043] [2023-08-24 12:52:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:52:49,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:49,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044495043] [2023-08-24 12:52:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044495043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:49,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574247985] [2023-08-24 12:52:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:49,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:49,546 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:49,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 12:52:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:49,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:52:49,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:52:49,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:52:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:52:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574247985] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:52:49,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:52:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:52:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224131754] [2023-08-24 12:52:49,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:52:49,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:52:49,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:49,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:52:49,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:52:49,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 565 [2023-08-24 12:52:49,826 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-24 12:52:49,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:49,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 565 [2023-08-24 12:52:49,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:52:53,487 INFO L124 PetriNetUnfolderBase]: 20035/30550 cut-off events. [2023-08-24 12:52:53,487 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2023-08-24 12:52:53,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59453 conditions, 30550 events. 20035/30550 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 209439 event pairs, 17166 based on Foata normal form. 3/25130 useless extension candidates. Maximal degree in co-relation 59425. Up to 28195 conditions per place. [2023-08-24 12:52:53,628 INFO L140 encePairwiseOnDemand]: 562/565 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-24 12:52:53,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 392 flow [2023-08-24 12:52:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:52:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:52:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1605 transitions. [2023-08-24 12:52:53,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47345132743362833 [2023-08-24 12:52:53,630 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1605 transitions. [2023-08-24 12:52:53,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1605 transitions. [2023-08-24 12:52:53,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:52:53,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1605 transitions. [2023-08-24 12:52:53,633 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-24 12:52:53,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:53,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:53,637 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 222 flow. Second operand 6 states and 1605 transitions. [2023-08-24 12:52:53,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 392 flow [2023-08-24 12:52:53,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:52:53,640 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 256 flow [2023-08-24 12:52:53,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, 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-24 12:52:53,640 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2023-08-24 12:52:53,640 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 256 flow [2023-08-24 12:52:53,641 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-24 12:52:53,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:52:53,641 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:52:53,651 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-24 12:52:53,846 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,SelfDestructingSolverStorable13 [2023-08-24 12:52:53,846 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-24 12:52:53,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:52:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 469470126, now seen corresponding path program 2 times [2023-08-24 12:52:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:52:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130848805] [2023-08-24 12:52:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:52:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:52:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:52:54,263 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-24 12:52:54,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:52:54,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130848805] [2023-08-24 12:52:54,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130848805] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:52:54,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826693736] [2023-08-24 12:52:54,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:52:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:52:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:52:54,265 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:52:54,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 12:52:54,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:52:54,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:52:54,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-24 12:52:54,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:52:54,386 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-24 12:52:54,839 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:52:54,840 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-24 12:52:55,058 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-24 12:52:55,472 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-24 12:52:55,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:52:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826693736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:52:55,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:52:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:52:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818977061] [2023-08-24 12:52:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:52:55,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:52:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:52:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:52:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:52:55,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 565 [2023-08-24 12:52:55,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:52:55,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:52:55,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 565 [2023-08-24 12:52:55,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:00,614 INFO L124 PetriNetUnfolderBase]: 28032/43763 cut-off events. [2023-08-24 12:53:00,614 INFO L125 PetriNetUnfolderBase]: For 1065/1065 co-relation queries the response was YES. [2023-08-24 12:53:00,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85595 conditions, 43763 events. 28032/43763 cut-off events. For 1065/1065 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 328353 event pairs, 4429 based on Foata normal form. 0/36175 useless extension candidates. Maximal degree in co-relation 85559. Up to 30481 conditions per place. [2023-08-24 12:53:00,828 INFO L140 encePairwiseOnDemand]: 555/565 looper letters, 201 selfloop transitions, 16 changer transitions 0/233 dead transitions. [2023-08-24 12:53:00,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 233 transitions, 996 flow [2023-08-24 12:53:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:53:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:53:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1486 transitions. [2023-08-24 12:53:00,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383480825958702 [2023-08-24 12:53:00,831 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1486 transitions. [2023-08-24 12:53:00,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1486 transitions. [2023-08-24 12:53:00,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:00,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1486 transitions. [2023-08-24 12:53:00,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.66666666666666) internal successors, (1486), 6 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:00,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:00,836 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:00,836 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 256 flow. Second operand 6 states and 1486 transitions. [2023-08-24 12:53:00,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 233 transitions, 996 flow [2023-08-24 12:53:00,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 233 transitions, 982 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:53:00,840 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 345 flow [2023-08-24 12:53:00,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, 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-24 12:53:00,841 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2023-08-24 12:53:00,841 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 345 flow [2023-08-24 12:53:00,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:00,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:00,841 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:53:00,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 12:53:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 12:53:01,047 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-24 12:53:01,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1045638765, now seen corresponding path program 1 times [2023-08-24 12:53:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053587851] [2023-08-24 12:53:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:01,169 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-24 12:53:01,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053587851] [2023-08-24 12:53:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053587851] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630899604] [2023-08-24 12:53:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:01,171 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:53:01,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 12:53:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:01,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:53:01,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:01,655 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-24 12:53:01,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:53:02,243 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-24 12:53:02,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630899604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:53:02,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:53:02,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-24 12:53:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660575231] [2023-08-24 12:53:02,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:53:02,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 12:53:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:02,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 12:53:02,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:53:02,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 565 [2023-08-24 12:53:02,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 248.92857142857142) internal successors, (3485), 14 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:02,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:02,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 565 [2023-08-24 12:53:02,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:07,988 INFO L124 PetriNetUnfolderBase]: 25483/40304 cut-off events. [2023-08-24 12:53:07,989 INFO L125 PetriNetUnfolderBase]: For 8365/8367 co-relation queries the response was YES. [2023-08-24 12:53:08,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86542 conditions, 40304 events. 25483/40304 cut-off events. For 8365/8367 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 307698 event pairs, 621 based on Foata normal form. 32/35589 useless extension candidates. Maximal degree in co-relation 86483. Up to 36042 conditions per place. [2023-08-24 12:53:08,206 INFO L140 encePairwiseOnDemand]: 560/565 looper letters, 142 selfloop transitions, 14 changer transitions 0/174 dead transitions. [2023-08-24 12:53:08,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 849 flow [2023-08-24 12:53:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:53:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:53:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3601 transitions. [2023-08-24 12:53:08,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45524652338811633 [2023-08-24 12:53:08,210 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3601 transitions. [2023-08-24 12:53:08,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3601 transitions. [2023-08-24 12:53:08,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:08,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3601 transitions. [2023-08-24 12:53:08,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 257.2142857142857) internal successors, (3601), 14 states have internal predecessors, (3601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:08,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 565.0) internal successors, (8475), 15 states have internal predecessors, (8475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:08,221 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 565.0) internal successors, (8475), 15 states have internal predecessors, (8475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:08,221 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 345 flow. Second operand 14 states and 3601 transitions. [2023-08-24 12:53:08,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 849 flow [2023-08-24 12:53:08,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 174 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:53:08,258 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 415 flow [2023-08-24 12:53:08,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, 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=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=415, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2023-08-24 12:53:08,259 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 34 predicate places. [2023-08-24 12:53:08,259 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 415 flow [2023-08-24 12:53:08,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 248.92857142857142) internal successors, (3485), 14 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:08,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:08,259 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:53:08,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 12:53:08,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 12:53:08,465 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-24 12:53:08,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash 430886920, now seen corresponding path program 1 times [2023-08-24 12:53:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:08,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484890609] [2023-08-24 12:53:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:09,127 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-24 12:53:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484890609] [2023-08-24 12:53:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484890609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292420678] [2023-08-24 12:53:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:09,129 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:53:09,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 12:53:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:09,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-24 12:53:09,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:09,273 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-24 12:53:09,996 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:53:09,997 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-24 12:53:10,152 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-24 12:53:10,348 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-24 12:53:10,733 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-24 12:53:10,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:53:17,021 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (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_578) |c_~#cache~0.base|))) is different from false [2023-08-24 12:53:17,540 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-24 12:53:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292420678] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:53:17,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:53:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-24 12:53:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079589739] [2023-08-24 12:53:17,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:53:17,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 12:53:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 12:53:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=79, Unknown=3, NotChecked=18, Total=132 [2023-08-24 12:53:17,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 565 [2023-08-24 12:53:17,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 415 flow. Second operand has 12 states, 12 states have (on average 214.91666666666666) internal successors, (2579), 12 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:17,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:17,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 565 [2023-08-24 12:53:17,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:27,114 INFO L124 PetriNetUnfolderBase]: 32565/50063 cut-off events. [2023-08-24 12:53:27,114 INFO L125 PetriNetUnfolderBase]: For 12261/12265 co-relation queries the response was YES. [2023-08-24 12:53:27,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109347 conditions, 50063 events. 32565/50063 cut-off events. For 12261/12265 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 373013 event pairs, 4978 based on Foata normal form. 4/44165 useless extension candidates. Maximal degree in co-relation 109274. Up to 30277 conditions per place. [2023-08-24 12:53:27,403 INFO L140 encePairwiseOnDemand]: 551/565 looper letters, 251 selfloop transitions, 33 changer transitions 0/300 dead transitions. [2023-08-24 12:53:27,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 300 transitions, 1474 flow [2023-08-24 12:53:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 12:53:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 12:53:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1746 transitions. [2023-08-24 12:53:27,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4414664981036662 [2023-08-24 12:53:27,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1746 transitions. [2023-08-24 12:53:27,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1746 transitions. [2023-08-24 12:53:27,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:27,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1746 transitions. [2023-08-24 12:53:27,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 249.42857142857142) internal successors, (1746), 7 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:27,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 565.0) internal successors, (4520), 8 states have internal predecessors, (4520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:27,409 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 565.0) internal successors, (4520), 8 states have internal predecessors, (4520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:27,409 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 415 flow. Second operand 7 states and 1746 transitions. [2023-08-24 12:53:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 300 transitions, 1474 flow [2023-08-24 12:53:27,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 300 transitions, 1397 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-08-24 12:53:27,452 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 573 flow [2023-08-24 12:53:27,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=123, PETRI_TRANSITIONS=136} [2023-08-24 12:53:27,452 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2023-08-24 12:53:27,453 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 573 flow [2023-08-24 12:53:27,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 214.91666666666666) internal successors, (2579), 12 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:27,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:27,453 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:53:27,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 12:53:27,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 12:53:27,658 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-24 12:53:27,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash -852450530, now seen corresponding path program 1 times [2023-08-24 12:53:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:27,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769283925] [2023-08-24 12:53:27,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:27,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:53:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769283925] [2023-08-24 12:53:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769283925] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357341807] [2023-08-24 12:53:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:27,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:27,909 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-24 12:53:27,912 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-24 12:53:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:28,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 12:53:28,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:53:28,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:53:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:53:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357341807] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:53:28,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:53:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-24 12:53:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669485843] [2023-08-24 12:53:28,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:53:28,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 12:53:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 12:53:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-24 12:53:28,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 565 [2023-08-24 12:53:28,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 573 flow. Second operand has 9 states, 9 states have (on average 256.8888888888889) internal successors, (2312), 9 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:28,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:28,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 565 [2023-08-24 12:53:28,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:29,904 INFO L124 PetriNetUnfolderBase]: 2611/4625 cut-off events. [2023-08-24 12:53:29,904 INFO L125 PetriNetUnfolderBase]: For 3190/3190 co-relation queries the response was YES. [2023-08-24 12:53:29,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12837 conditions, 4625 events. 2611/4625 cut-off events. For 3190/3190 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 28797 event pairs, 121 based on Foata normal form. 477/4914 useless extension candidates. Maximal degree in co-relation 12348. Up to 2960 conditions per place. [2023-08-24 12:53:29,924 INFO L140 encePairwiseOnDemand]: 562/565 looper letters, 122 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2023-08-24 12:53:29,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 758 flow [2023-08-24 12:53:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:53:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:53:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1363 transitions. [2023-08-24 12:53:29,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824778761061947 [2023-08-24 12:53:29,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1363 transitions. [2023-08-24 12:53:29,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1363 transitions. [2023-08-24 12:53:29,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:29,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1363 transitions. [2023-08-24 12:53:29,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 272.6) internal successors, (1363), 5 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:29,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 565.0) internal successors, (3390), 6 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:29,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 565.0) internal successors, (3390), 6 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:29,930 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 573 flow. Second operand 5 states and 1363 transitions. [2023-08-24 12:53:29,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 758 flow [2023-08-24 12:53:29,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 720 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-08-24 12:53:29,937 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 253 flow [2023-08-24 12:53:29,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-08-24 12:53:29,938 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2023-08-24 12:53:29,938 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 253 flow [2023-08-24 12:53:29,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 256.8888888888889) internal successors, (2312), 9 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:29,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:29,938 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-24 12:53:29,943 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-24 12:53:30,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:30,139 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-24 12:53:30,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:30,139 INFO L85 PathProgramCache]: Analyzing trace with hash -537574792, now seen corresponding path program 1 times [2023-08-24 12:53:30,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:30,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299311709] [2023-08-24 12:53:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:53:30,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299311709] [2023-08-24 12:53:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299311709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:53:30,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:53:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 12:53:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261010971] [2023-08-24 12:53:30,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:53:30,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 12:53:30,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 12:53:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:53:30,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 565 [2023-08-24 12:53:30,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:30,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:30,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 565 [2023-08-24 12:53:30,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:32,466 INFO L124 PetriNetUnfolderBase]: 4011/6749 cut-off events. [2023-08-24 12:53:32,466 INFO L125 PetriNetUnfolderBase]: For 5160/5160 co-relation queries the response was YES. [2023-08-24 12:53:32,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17861 conditions, 6749 events. 4011/6749 cut-off events. For 5160/5160 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 42764 event pairs, 1334 based on Foata normal form. 291/6719 useless extension candidates. Maximal degree in co-relation 7998. Up to 3488 conditions per place. [2023-08-24 12:53:32,487 INFO L140 encePairwiseOnDemand]: 549/565 looper letters, 101 selfloop transitions, 21 changer transitions 0/128 dead transitions. [2023-08-24 12:53:32,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 709 flow [2023-08-24 12:53:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:53:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:53:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1127 transitions. [2023-08-24 12:53:32,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39893805309734515 [2023-08-24 12:53:32,489 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1127 transitions. [2023-08-24 12:53:32,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1127 transitions. [2023-08-24 12:53:32,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:32,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1127 transitions. [2023-08-24 12:53:32,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:32,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 565.0) internal successors, (3390), 6 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:32,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 565.0) internal successors, (3390), 6 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:32,491 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 253 flow. Second operand 5 states and 1127 transitions. [2023-08-24 12:53:32,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 709 flow [2023-08-24 12:53:32,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 700 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 12:53:32,496 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 369 flow [2023-08-24 12:53:32,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2023-08-24 12:53:32,496 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -6 predicate places. [2023-08-24 12:53:32,496 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 369 flow [2023-08-24 12:53:32,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:32,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:32,496 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-24 12:53:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 12:53:32,497 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-24 12:53:32,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1457760905, now seen corresponding path program 1 times [2023-08-24 12:53:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552833998] [2023-08-24 12:53:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:34,266 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-24 12:53:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552833998] [2023-08-24 12:53:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552833998] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143469012] [2023-08-24 12:53:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:34,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:34,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:34,267 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-24 12:53:34,269 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-24 12:53:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:34,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 12:53:34,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:35,304 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-24 12:53:35,842 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-24 12:53:35,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:53:35,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143469012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:53:35,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:53:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-08-24 12:53:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681702378] [2023-08-24 12:53:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:53:35,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:53:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:53:35,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:53:35,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 565 [2023-08-24 12:53:35,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:35,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:35,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 565 [2023-08-24 12:53:35,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:38,578 INFO L124 PetriNetUnfolderBase]: 7531/12846 cut-off events. [2023-08-24 12:53:38,579 INFO L125 PetriNetUnfolderBase]: For 10306/10336 co-relation queries the response was YES. [2023-08-24 12:53:38,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39063 conditions, 12846 events. 7531/12846 cut-off events. For 10306/10336 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 93692 event pairs, 3285 based on Foata normal form. 148/12282 useless extension candidates. Maximal degree in co-relation 26366. Up to 5955 conditions per place. [2023-08-24 12:53:38,634 INFO L140 encePairwiseOnDemand]: 551/565 looper letters, 175 selfloop transitions, 18 changer transitions 0/200 dead transitions. [2023-08-24 12:53:38,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 200 transitions, 1305 flow [2023-08-24 12:53:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:53:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:53:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1364 transitions. [2023-08-24 12:53:38,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4023598820058997 [2023-08-24 12:53:38,636 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1364 transitions. [2023-08-24 12:53:38,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1364 transitions. [2023-08-24 12:53:38,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:38,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1364 transitions. [2023-08-24 12:53:38,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:38,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:38,643 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:38,643 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 369 flow. Second operand 6 states and 1364 transitions. [2023-08-24 12:53:38,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 200 transitions, 1305 flow [2023-08-24 12:53:38,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 200 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:53:38,651 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 542 flow [2023-08-24 12:53:38,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2023-08-24 12:53:38,651 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 1 predicate places. [2023-08-24 12:53:38,651 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 542 flow [2023-08-24 12:53:38,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:38,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:38,653 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-24 12:53:38,658 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-24 12:53:38,858 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-24 12:53:38,858 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-24 12:53:38,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1669326699, now seen corresponding path program 2 times [2023-08-24 12:53:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905002412] [2023-08-24 12:53:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:40,709 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-24 12:53:40,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905002412] [2023-08-24 12:53:40,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905002412] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086509068] [2023-08-24 12:53:40,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:53:40,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:40,711 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-24 12:53:40,714 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-24 12:53:40,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:53:40,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:53:40,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 12:53:40,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:41,750 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-24 12:53:42,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:53:42,371 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-24 12:53:42,606 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-24 12:53:42,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:53:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086509068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:53:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:53:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2023-08-24 12:53:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423001415] [2023-08-24 12:53:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:53:42,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:53:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:42,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:53:42,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:53:42,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 565 [2023-08-24 12:53:42,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 542 flow. Second operand has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:42,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:42,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 565 [2023-08-24 12:53:42,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:46,676 INFO L124 PetriNetUnfolderBase]: 12049/20768 cut-off events. [2023-08-24 12:53:46,676 INFO L125 PetriNetUnfolderBase]: For 24753/24789 co-relation queries the response was YES. [2023-08-24 12:53:46,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69046 conditions, 20768 events. 12049/20768 cut-off events. For 24753/24789 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 163732 event pairs, 5526 based on Foata normal form. 168/19728 useless extension candidates. Maximal degree in co-relation 33176. Up to 12257 conditions per place. [2023-08-24 12:53:46,772 INFO L140 encePairwiseOnDemand]: 557/565 looper letters, 203 selfloop transitions, 19 changer transitions 0/229 dead transitions. [2023-08-24 12:53:46,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 229 transitions, 1701 flow [2023-08-24 12:53:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:53:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:53:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1334 transitions. [2023-08-24 12:53:46,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935103244837758 [2023-08-24 12:53:46,774 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1334 transitions. [2023-08-24 12:53:46,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1334 transitions. [2023-08-24 12:53:46,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:46,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1334 transitions. [2023-08-24 12:53:46,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:46,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:46,777 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:46,777 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 542 flow. Second operand 6 states and 1334 transitions. [2023-08-24 12:53:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 229 transitions, 1701 flow [2023-08-24 12:53:46,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 229 transitions, 1691 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 12:53:46,788 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 728 flow [2023-08-24 12:53:46,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2023-08-24 12:53:46,789 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 7 predicate places. [2023-08-24 12:53:46,789 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 728 flow [2023-08-24 12:53:46,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:46,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:46,789 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-24 12:53:46,794 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-24 12:53:46,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:46,990 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-24 12:53:46,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2116226688, now seen corresponding path program 1 times [2023-08-24 12:53:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563121408] [2023-08-24 12:53:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:48,237 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-24 12:53:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563121408] [2023-08-24 12:53:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563121408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:53:48,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:53:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 12:53:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696995568] [2023-08-24 12:53:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:53:48,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 12:53:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 12:53:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-24 12:53:48,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 565 [2023-08-24 12:53:48,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 728 flow. Second operand has 8 states, 8 states have (on average 196.375) internal successors, (1571), 8 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:48,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:48,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 565 [2023-08-24 12:53:48,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:53:52,983 INFO L124 PetriNetUnfolderBase]: 12524/21603 cut-off events. [2023-08-24 12:53:52,983 INFO L125 PetriNetUnfolderBase]: For 32995/33085 co-relation queries the response was YES. [2023-08-24 12:53:53,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75529 conditions, 21603 events. 12524/21603 cut-off events. For 32995/33085 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 172686 event pairs, 5451 based on Foata normal form. 42/20382 useless extension candidates. Maximal degree in co-relation 50062. Up to 11667 conditions per place. [2023-08-24 12:53:53,124 INFO L140 encePairwiseOnDemand]: 558/565 looper letters, 211 selfloop transitions, 22 changer transitions 0/240 dead transitions. [2023-08-24 12:53:53,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 240 transitions, 1931 flow [2023-08-24 12:53:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:53:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:53:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2023-08-24 12:53:53,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817109144542773 [2023-08-24 12:53:53,125 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1294 transitions. [2023-08-24 12:53:53,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1294 transitions. [2023-08-24 12:53:53,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:53:53,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1294 transitions. [2023-08-24 12:53:53,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:53,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:53,129 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:53,129 INFO L175 Difference]: Start difference. First operand has 94 places, 114 transitions, 728 flow. Second operand 6 states and 1294 transitions. [2023-08-24 12:53:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 240 transitions, 1931 flow [2023-08-24 12:53:53,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 240 transitions, 1930 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:53:53,144 INFO L231 Difference]: Finished difference. Result has 100 places, 122 transitions, 874 flow [2023-08-24 12:53:53,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=100, PETRI_TRANSITIONS=122} [2023-08-24 12:53:53,145 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 13 predicate places. [2023-08-24 12:53:53,145 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 122 transitions, 874 flow [2023-08-24 12:53:53,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 196.375) internal successors, (1571), 8 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:53,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:53:53,145 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-24 12:53:53,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-24 12:53:53,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:53:53,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:53:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1834270335, now seen corresponding path program 3 times [2023-08-24 12:53:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:53:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565797935] [2023-08-24 12:53:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:53:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:53:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:53:54,911 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-24 12:53:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:53:54,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565797935] [2023-08-24 12:53:54,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565797935] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:53:54,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406642293] [2023-08-24 12:53:54,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:53:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:53:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:53:54,913 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-24 12:53:54,914 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-24 12:53:55,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 12:53:55,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:53:55,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 12:53:55,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:53:56,186 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-24 12:53:56,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:53:56,565 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-24 12:53:56,802 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-24 12:53:56,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:53:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406642293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:53:56,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:53:56,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2023-08-24 12:53:56,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467073720] [2023-08-24 12:53:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:53:56,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:53:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:53:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:53:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:53:56,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 565 [2023-08-24 12:53:56,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 122 transitions, 874 flow. Second operand has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:53:56,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:53:56,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 565 [2023-08-24 12:53:56,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:01,278 INFO L124 PetriNetUnfolderBase]: 12713/22019 cut-off events. [2023-08-24 12:54:01,278 INFO L125 PetriNetUnfolderBase]: For 42685/42745 co-relation queries the response was YES. [2023-08-24 12:54:01,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79266 conditions, 22019 events. 12713/22019 cut-off events. For 42685/42745 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 176263 event pairs, 6570 based on Foata normal form. 84/20820 useless extension candidates. Maximal degree in co-relation 51997. Up to 13251 conditions per place. [2023-08-24 12:54:01,390 INFO L140 encePairwiseOnDemand]: 558/565 looper letters, 202 selfloop transitions, 19 changer transitions 0/228 dead transitions. [2023-08-24 12:54:01,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 228 transitions, 1924 flow [2023-08-24 12:54:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:54:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:54:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1331 transitions. [2023-08-24 12:54:01,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3926253687315634 [2023-08-24 12:54:01,392 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1331 transitions. [2023-08-24 12:54:01,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1331 transitions. [2023-08-24 12:54:01,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:01,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1331 transitions. [2023-08-24 12:54:01,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.83333333333334) internal successors, (1331), 6 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:01,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:01,396 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 565.0) internal successors, (3955), 7 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:01,396 INFO L175 Difference]: Start difference. First operand has 100 places, 122 transitions, 874 flow. Second operand 6 states and 1331 transitions. [2023-08-24 12:54:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 228 transitions, 1924 flow [2023-08-24 12:54:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 228 transitions, 1908 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 12:54:01,419 INFO L231 Difference]: Finished difference. Result has 106 places, 127 transitions, 1001 flow [2023-08-24 12:54:01,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1001, PETRI_PLACES=106, PETRI_TRANSITIONS=127} [2023-08-24 12:54:01,419 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 19 predicate places. [2023-08-24 12:54:01,420 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 1001 flow [2023-08-24 12:54:01,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:01,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:01,420 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-24 12:54:01,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-24 12:54:01,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:01,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:54:01,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:01,626 INFO L85 PathProgramCache]: Analyzing trace with hash -599969380, now seen corresponding path program 2 times [2023-08-24 12:54:01,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:01,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262069228] [2023-08-24 12:54:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:03,116 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-24 12:54:03,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:03,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262069228] [2023-08-24 12:54:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262069228] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:03,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880214533] [2023-08-24 12:54:03,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:54:03,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:03,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:03,118 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:54:03,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-24 12:54:03,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:54:03,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:54:03,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-24 12:54:03,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:04,077 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-24 12:54:04,271 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-24 12:54:04,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:54:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880214533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:54:04,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:54:04,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-08-24 12:54:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974771419] [2023-08-24 12:54:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:54:04,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:54:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:54:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:54:04,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 565 [2023-08-24 12:54:04,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 1001 flow. Second operand has 6 states, 6 states have (on average 210.16666666666666) internal successors, (1261), 6 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:04,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:04,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 565 [2023-08-24 12:54:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:08,082 INFO L124 PetriNetUnfolderBase]: 12295/21226 cut-off events. [2023-08-24 12:54:08,082 INFO L125 PetriNetUnfolderBase]: For 45039/45114 co-relation queries the response was YES. [2023-08-24 12:54:08,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77766 conditions, 21226 events. 12295/21226 cut-off events. For 45039/45114 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 170442 event pairs, 5471 based on Foata normal form. 63/20083 useless extension candidates. Maximal degree in co-relation 50334. Up to 11781 conditions per place. [2023-08-24 12:54:08,239 INFO L140 encePairwiseOnDemand]: 552/565 looper letters, 235 selfloop transitions, 49 changer transitions 0/291 dead transitions. [2023-08-24 12:54:08,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 291 transitions, 2513 flow [2023-08-24 12:54:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 12:54:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 12:54:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1623 transitions. [2023-08-24 12:54:08,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41036662452591655 [2023-08-24 12:54:08,241 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1623 transitions. [2023-08-24 12:54:08,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1623 transitions. [2023-08-24 12:54:08,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:08,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1623 transitions. [2023-08-24 12:54:08,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 231.85714285714286) internal successors, (1623), 7 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:08,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 565.0) internal successors, (4520), 8 states have internal predecessors, (4520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:08,245 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 565.0) internal successors, (4520), 8 states have internal predecessors, (4520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:08,245 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 1001 flow. Second operand 7 states and 1623 transitions. [2023-08-24 12:54:08,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 291 transitions, 2513 flow [2023-08-24 12:54:08,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 291 transitions, 2492 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 12:54:08,272 INFO L231 Difference]: Finished difference. Result has 113 places, 144 transitions, 1373 flow [2023-08-24 12:54:08,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1373, PETRI_PLACES=113, PETRI_TRANSITIONS=144} [2023-08-24 12:54:08,273 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 26 predicate places. [2023-08-24 12:54:08,273 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 144 transitions, 1373 flow [2023-08-24 12:54:08,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.16666666666666) internal successors, (1261), 6 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:08,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:08,273 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-24 12:54:08,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-24 12:54:08,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:08,479 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:54:08,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1337335922, now seen corresponding path program 3 times [2023-08-24 12:54:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237068868] [2023-08-24 12:54:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:09,783 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-24 12:54:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237068868] [2023-08-24 12:54:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237068868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:54:09,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:54:09,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 12:54:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591781028] [2023-08-24 12:54:09,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:54:09,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 12:54:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:09,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 12:54:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-24 12:54:09,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 565 [2023-08-24 12:54:09,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 144 transitions, 1373 flow. Second operand has 8 states, 8 states have (on average 196.375) internal successors, (1571), 8 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:09,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:09,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 565 [2023-08-24 12:54:09,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:14,268 INFO L124 PetriNetUnfolderBase]: 11638/20219 cut-off events. [2023-08-24 12:54:14,268 INFO L125 PetriNetUnfolderBase]: For 48885/48933 co-relation queries the response was YES. [2023-08-24 12:54:14,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74849 conditions, 20219 events. 11638/20219 cut-off events. For 48885/48933 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 160448 event pairs, 6907 based on Foata normal form. 36/19106 useless extension candidates. Maximal degree in co-relation 41041. Up to 11616 conditions per place. [2023-08-24 12:54:14,434 INFO L140 encePairwiseOnDemand]: 558/565 looper letters, 199 selfloop transitions, 17 changer transitions 0/223 dead transitions. [2023-08-24 12:54:14,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 223 transitions, 2046 flow [2023-08-24 12:54:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 12:54:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 12:54:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1487 transitions. [2023-08-24 12:54:14,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37597977243994946 [2023-08-24 12:54:14,437 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1487 transitions. [2023-08-24 12:54:14,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1487 transitions. [2023-08-24 12:54:14,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:14,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1487 transitions. [2023-08-24 12:54:14,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 212.42857142857142) internal successors, (1487), 7 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:14,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 565.0) internal successors, (4520), 8 states have internal predecessors, (4520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:14,442 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 565.0) internal successors, (4520), 8 states have internal predecessors, (4520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:14,442 INFO L175 Difference]: Start difference. First operand has 113 places, 144 transitions, 1373 flow. Second operand 7 states and 1487 transitions. [2023-08-24 12:54:14,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 223 transitions, 2046 flow [2023-08-24 12:54:14,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 223 transitions, 1969 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-24 12:54:14,501 INFO L231 Difference]: Finished difference. Result has 116 places, 130 transitions, 1100 flow [2023-08-24 12:54:14,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1100, PETRI_PLACES=116, PETRI_TRANSITIONS=130} [2023-08-24 12:54:14,501 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 29 predicate places. [2023-08-24 12:54:14,501 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 130 transitions, 1100 flow [2023-08-24 12:54:14,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 196.375) internal successors, (1571), 8 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:14,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:14,502 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-24 12:54:14,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-24 12:54:14,502 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:54:14,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1956535938, now seen corresponding path program 1 times [2023-08-24 12:54:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800865749] [2023-08-24 12:54:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:15,796 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-24 12:54:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800865749] [2023-08-24 12:54:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800865749] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626660277] [2023-08-24 12:54:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:15,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:15,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:15,798 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:54:15,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 12:54:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:15,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-24 12:54:15,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:15,959 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-24 12:54:16,543 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54:16,544 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-24 12:54:16,716 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-24 12:54:17,495 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-24 12:54:18,052 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-24 12:54:18,467 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-24 12:54:18,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:54:30,522 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-24 12:54:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626660277] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:54:30,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:54:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-24 12:54:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515951592] [2023-08-24 12:54:30,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:54:30,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:54:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:54:30,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:54:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=375, Unknown=3, NotChecked=0, Total=462 [2023-08-24 12:54:30,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 565 [2023-08-24 12:54:30,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 130 transitions, 1100 flow. Second operand has 22 states, 22 states have (on average 204.4090909090909) internal successors, (4497), 22 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:30,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:54:30,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 565 [2023-08-24 12:54:30,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:54:44,352 INFO L124 PetriNetUnfolderBase]: 17697/30530 cut-off events. [2023-08-24 12:54:44,352 INFO L125 PetriNetUnfolderBase]: For 68574/68643 co-relation queries the response was YES. [2023-08-24 12:54:44,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113326 conditions, 30530 events. 17697/30530 cut-off events. For 68574/68643 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 255627 event pairs, 3342 based on Foata normal form. 159/29038 useless extension candidates. Maximal degree in co-relation 49629. Up to 15109 conditions per place. [2023-08-24 12:54:44,637 INFO L140 encePairwiseOnDemand]: 552/565 looper letters, 409 selfloop transitions, 45 changer transitions 0/462 dead transitions. [2023-08-24 12:54:44,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 462 transitions, 4814 flow [2023-08-24 12:54:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:54:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:54:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2642 transitions. [2023-08-24 12:54:44,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3896755162241888 [2023-08-24 12:54:44,642 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2642 transitions. [2023-08-24 12:54:44,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2642 transitions. [2023-08-24 12:54:44,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:54:44,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2642 transitions. [2023-08-24 12:54:44,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 220.16666666666666) internal successors, (2642), 12 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:44,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 565.0) internal successors, (7345), 13 states have internal predecessors, (7345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:44,650 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 565.0) internal successors, (7345), 13 states have internal predecessors, (7345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:44,650 INFO L175 Difference]: Start difference. First operand has 116 places, 130 transitions, 1100 flow. Second operand 12 states and 2642 transitions. [2023-08-24 12:54:44,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 462 transitions, 4814 flow [2023-08-24 12:54:44,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 462 transitions, 4746 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 12:54:44,724 INFO L231 Difference]: Finished difference. Result has 131 places, 169 transitions, 1493 flow [2023-08-24 12:54:44,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1493, PETRI_PLACES=131, PETRI_TRANSITIONS=169} [2023-08-24 12:54:44,724 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 44 predicate places. [2023-08-24 12:54:44,724 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 169 transitions, 1493 flow [2023-08-24 12:54:44,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 204.4090909090909) internal successors, (4497), 22 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:54:44,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:54:44,725 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, 1] [2023-08-24 12:54:44,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 12:54:44,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:44,926 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:54:44,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:54:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 61005083, now seen corresponding path program 1 times [2023-08-24 12:54:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:54:44,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954107849] [2023-08-24 12:54:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:54:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:46,370 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-24 12:54:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:54:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954107849] [2023-08-24 12:54:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954107849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:54:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750262304] [2023-08-24 12:54:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:54:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:54:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:54:46,372 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:54:46,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 12:54:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:54:46,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:54:46,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:54:46,526 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-24 12:54:47,100 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:54:47,100 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-24 12:54:47,309 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-24 12:54:48,091 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-24 12:54:48,610 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-24 12:54:54,074 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-24 12:54:54,696 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-24 12:54:54,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:54:54,745 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1274 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-24 12:54:54,846 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (v_ArrVal_1274 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:54:56,889 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (v_ArrVal_1274 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:54:59,027 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (v_ArrVal_1274 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1273)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:54:59,386 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1274 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1273)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70|)))) is different from false [2023-08-24 12:54:59,605 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1269 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1274 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1269))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1273))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-24 12:55:00,394 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-24 12:55:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750262304] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:55:00,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:55:00,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-08-24 12:55:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613960050] [2023-08-24 12:55:00,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:55:00,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 12:55:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:55:00,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 12:55:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=215, Unknown=8, NotChecked=210, Total=506 [2023-08-24 12:55:00,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 565 [2023-08-24 12:55:00,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 169 transitions, 1493 flow. Second operand has 23 states, 23 states have (on average 208.6086956521739) internal successors, (4798), 23 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:55:00,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:55:00,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 565 [2023-08-24 12:55:00,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:55:02,636 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 [0] [2023-08-24 12:55:09,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 [0, 1] [2023-08-24 12:55:13,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 12:55:15,472 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 [0, 1] [2023-08-24 12:55:17,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 12:55:23,800 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 [0, 1] [2023-08-24 12:55:25,852 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 [0] [2023-08-24 12:55:27,866 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 [0] [2023-08-24 12:55:29,881 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 [0] [2023-08-24 12:55:31,904 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 [0, 1] [2023-08-24 12:55:36,102 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 [0] [2023-08-24 12:55:38,126 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 [0] [2023-08-24 12:55:40,167 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 [0] [2023-08-24 12:55:42,211 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 [0] [2023-08-24 12:55:44,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 [0] [2023-08-24 12:55:46,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 [0] [2023-08-24 12:55:48,245 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 [0] [2023-08-24 12:55:50,250 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 [0] [2023-08-24 12:55:52,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 [0] [2023-08-24 12:55:54,321 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 [0] [2023-08-24 12:55:56,333 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 [0] [2023-08-24 12:55:58,348 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 [0] [2023-08-24 12:56:00,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:02,378 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 [0] [2023-08-24 12:56:04,434 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 [0] [2023-08-24 12:56:10,805 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 [0] [2023-08-24 12:56:12,996 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 [0] [2023-08-24 12:56:15,054 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 [0] [2023-08-24 12:56:17,139 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 [0] [2023-08-24 12:56:19,200 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 [0] [2023-08-24 12:56:21,448 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 [0] [2023-08-24 12:56:23,818 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 [0] [2023-08-24 12:56:26,233 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 [0] [2023-08-24 12:56:28,249 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 [0] [2023-08-24 12:56:32,804 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 [0] [2023-08-24 12:56:34,811 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 [0] [2023-08-24 12:56:41,394 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 [0] [2023-08-24 12:56:43,403 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 [0] [2023-08-24 12:56:45,705 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 [0] [2023-08-24 12:56:48,041 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 [0] [2023-08-24 12:56:50,049 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 [0] [2023-08-24 12:56:52,573 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 [0] [2023-08-24 12:57:01,955 INFO L124 PetriNetUnfolderBase]: 26956/46497 cut-off events. [2023-08-24 12:57:01,955 INFO L125 PetriNetUnfolderBase]: For 133502/133602 co-relation queries the response was YES. [2023-08-24 12:57:02,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190239 conditions, 46497 events. 26956/46497 cut-off events. For 133502/133602 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 401725 event pairs, 5431 based on Foata normal form. 154/44204 useless extension candidates. Maximal degree in co-relation 135651. Up to 19856 conditions per place. [2023-08-24 12:57:02,317 INFO L140 encePairwiseOnDemand]: 554/565 looper letters, 412 selfloop transitions, 61 changer transitions 0/481 dead transitions. [2023-08-24 12:57:02,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 481 transitions, 5009 flow [2023-08-24 12:57:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 12:57:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 12:57:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2467 transitions. [2023-08-24 12:57:02,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3969428801287208 [2023-08-24 12:57:02,322 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2467 transitions. [2023-08-24 12:57:02,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2467 transitions. [2023-08-24 12:57:02,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:02,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2467 transitions. [2023-08-24 12:57:02,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 224.27272727272728) internal successors, (2467), 11 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:02,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 565.0) internal successors, (6780), 12 states have internal predecessors, (6780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:02,329 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 565.0) internal successors, (6780), 12 states have internal predecessors, (6780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:02,329 INFO L175 Difference]: Start difference. First operand has 131 places, 169 transitions, 1493 flow. Second operand 11 states and 2467 transitions. [2023-08-24 12:57:02,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 481 transitions, 5009 flow [2023-08-24 12:57:02,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 481 transitions, 4951 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-24 12:57:02,683 INFO L231 Difference]: Finished difference. Result has 145 places, 215 transitions, 2158 flow [2023-08-24 12:57:02,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2158, PETRI_PLACES=145, PETRI_TRANSITIONS=215} [2023-08-24 12:57:02,684 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 58 predicate places. [2023-08-24 12:57:02,684 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 215 transitions, 2158 flow [2023-08-24 12:57:02,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 208.6086956521739) internal successors, (4798), 23 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:02,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:02,685 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, 1, 1] [2023-08-24 12:57:02,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 12:57:02,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-24 12:57:02,889 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:57:02,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1632809054, now seen corresponding path program 1 times [2023-08-24 12:57:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508019366] [2023-08-24 12:57:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:57:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508019366] [2023-08-24 12:57:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508019366] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:57:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340539078] [2023-08-24 12:57:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:57:04,175 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:57:04,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 12:57:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:04,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 12:57:04,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:57:04,414 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-24 12:57:04,991 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:57:04,992 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-24 12:57:05,178 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-24 12:57:05,388 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-24 12:57:06,293 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-24 12:57:06,874 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-24 12:57:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:57:07,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:57:16,339 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1371 (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_1371) |c_~#cache~0.base|))) is different from false [2023-08-24 12:57:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 1 not checked. [2023-08-24 12:57:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340539078] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:57:17,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:57:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-24 12:57:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137490504] [2023-08-24 12:57:17,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:57:17,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:57:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:57:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:57:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=341, Unknown=3, NotChecked=38, Total=462 [2023-08-24 12:57:17,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 565 [2023-08-24 12:57:17,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 215 transitions, 2158 flow. Second operand has 22 states, 22 states have (on average 205.0909090909091) internal successors, (4512), 22 states have internal predecessors, (4512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:17,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:57:17,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 565 [2023-08-24 12:57:17,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:57:23,652 WARN L234 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:57:40,952 INFO L124 PetriNetUnfolderBase]: 30250/52325 cut-off events. [2023-08-24 12:57:40,952 INFO L125 PetriNetUnfolderBase]: For 195007/195164 co-relation queries the response was YES. [2023-08-24 12:57:41,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228296 conditions, 52325 events. 30250/52325 cut-off events. For 195007/195164 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 461189 event pairs, 6853 based on Foata normal form. 147/49726 useless extension candidates. Maximal degree in co-relation 158387. Up to 31019 conditions per place. [2023-08-24 12:57:41,493 INFO L140 encePairwiseOnDemand]: 549/565 looper letters, 474 selfloop transitions, 72 changer transitions 0/554 dead transitions. [2023-08-24 12:57:41,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 554 transitions, 6421 flow [2023-08-24 12:57:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:57:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:57:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3049 transitions. [2023-08-24 12:57:41,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854614412136536 [2023-08-24 12:57:41,498 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3049 transitions. [2023-08-24 12:57:41,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3049 transitions. [2023-08-24 12:57:41,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:57:41,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3049 transitions. [2023-08-24 12:57:41,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 217.78571428571428) internal successors, (3049), 14 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:41,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 565.0) internal successors, (8475), 15 states have internal predecessors, (8475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:41,507 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 565.0) internal successors, (8475), 15 states have internal predecessors, (8475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:41,508 INFO L175 Difference]: Start difference. First operand has 145 places, 215 transitions, 2158 flow. Second operand 14 states and 3049 transitions. [2023-08-24 12:57:41,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 554 transitions, 6421 flow [2023-08-24 12:57:42,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 554 transitions, 6385 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-24 12:57:42,022 INFO L231 Difference]: Finished difference. Result has 166 places, 257 transitions, 2806 flow [2023-08-24 12:57:42,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2806, PETRI_PLACES=166, PETRI_TRANSITIONS=257} [2023-08-24 12:57:42,022 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 79 predicate places. [2023-08-24 12:57:42,023 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 257 transitions, 2806 flow [2023-08-24 12:57:42,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 205.0909090909091) internal successors, (4512), 22 states have internal predecessors, (4512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:57:42,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:57:42,023 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:57:42,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-24 12:57:42,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-24 12:57:42,225 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 12:57:42,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:57:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1797562239, now seen corresponding path program 1 times [2023-08-24 12:57:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:57:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390273516] [2023-08-24 12:57:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:57:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:44,005 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-24 12:57:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:57:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390273516] [2023-08-24 12:57:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390273516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:57:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652082679] [2023-08-24 12:57:44,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:57:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:57:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:57:44,007 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:57:44,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 12:57:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:57:44,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 12:57:44,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:57:44,266 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-24 12:57:44,843 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:57:44,843 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-24 12:57:45,080 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-24 12:57:45,275 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-24 12:57:47,844 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-24 12:57:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:57:50,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:57:55,847 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1473 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1473) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74|) 0))) is different from false [2023-08-24 12:57:57,892 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1473 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1473) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61|)))) is different from false [2023-08-24 12:57:59,934 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1473 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| 28)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1473) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74|) 0))) is different from false [2023-08-24 12:58:05,353 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1473 Int) (v_ArrVal_1472 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1472) |c_~#cache~0.base|))) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| 28)) (not (= (select .cse0 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (= (select (store .cse0 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1473) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74|) 0)))) is different from false [2023-08-24 12:58:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2023-08-24 12:58:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652082679] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:58:06,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:58:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-08-24 12:58:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329198157] [2023-08-24 12:58:06,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:58:06,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 12:58:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:58:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 12:58:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=575, Unknown=8, NotChecked=212, Total=930 [2023-08-24 12:58:06,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 565 [2023-08-24 12:58:06,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 257 transitions, 2806 flow. Second operand has 31 states, 31 states have (on average 198.3548387096774) internal successors, (6149), 31 states have internal predecessors, (6149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:58:06,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:58:06,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 565 [2023-08-24 12:58:06,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:58:11,888 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 [0] [2023-08-24 12:58:16,338 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 [0] [2023-08-24 12:58:18,401 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 [0] [2023-08-24 12:58:20,465 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 [0] [2023-08-24 12:58:22,702 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 [0] [2023-08-24 12:58:24,940 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 [0] [2023-08-24 12:58:27,011 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 [0] [2023-08-24 12:58:31,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:33,392 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 [0] [2023-08-24 12:58:35,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:37,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:39,866 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 [0] [2023-08-24 12:58:51,032 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 [0] [2023-08-24 12:58:55,186 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 [0] [2023-08-24 12:58:58,151 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 [0] [2023-08-24 12:59:00,415 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 [0] [2023-08-24 12:59:11,358 WARN L234 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 42 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:59:13,494 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 [0] [2023-08-24 12:59:49,898 WARN L234 SmtUtils]: Spent 30.30s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:59:59,023 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-24 13:00:01,027 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-24 13:00:03,031 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-24 13:00:05,047 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 [0, 1] [2023-08-24 13:00:07,056 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-24 13:00:09,064 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-24 13:00:19,536 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-24 13:00:21,540 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-24 13:00:23,550 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-24 13:00:25,559 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-24 13:00:27,889 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-24 13:00:30,273 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-24 13:00:32,281 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-24 13:00:34,289 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-24 13:00:36,291 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-24 13:00:38,294 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 [0, 1] [2023-08-24 13:00:40,300 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-24 13:00:42,303 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-24 13:00:44,876 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-24 13:00:46,880 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-24 13:00:48,882 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-24 13:00:50,890 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-24 13:00:52,906 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 [0, 1] [2023-08-24 13:00:54,912 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-24 13:00:56,918 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-24 13:00:59,056 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 [0] [2023-08-24 13:01:04,294 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 [0] [2023-08-24 13:01:06,362 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 [0] [2023-08-24 13:01:08,417 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 [0] [2023-08-24 13:01:10,456 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 [0] Received shutdown request... [2023-08-24 13:01:12,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:01:12,190 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:01:12,478 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 [0] [2023-08-24 13:01:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 13:01:12,482 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 13:01:12,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 13:01:12,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-24 13:01:12,687 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 196/565 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2714 conditions, 570 events (242/569 cut-off events. For 4508/4510 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3885 event pairs, 63 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 2664. Up to 190 conditions per place.). [2023-08-24 13:01:12,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 13:01:12,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-24 13:01:12,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-24 13:01:12,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 13:01:12,688 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:01:12,688 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-24 13:01:12,690 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-24 13:01:12,690 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 13:01:12,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 01:01:12 BasicIcfg [2023-08-24 13:01:12,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 13:01:12,695 INFO L158 Benchmark]: Toolchain (without parser) took 845975.59ms. Allocated memory was 350.2MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 325.5MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-24 13:01:12,696 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 350.2MB. Free memory was 327.0MB in the beginning and 327.0MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:01:12,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.75ms. Allocated memory is still 350.2MB. Free memory was 325.2MB in the beginning and 295.5MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 13:01:12,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.05ms. Allocated memory is still 350.2MB. Free memory was 295.5MB in the beginning and 292.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:01:12,697 INFO L158 Benchmark]: Boogie Preprocessor took 47.63ms. Allocated memory is still 350.2MB. Free memory was 292.6MB in the beginning and 290.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 13:01:12,697 INFO L158 Benchmark]: RCFGBuilder took 632.60ms. Allocated memory is still 350.2MB. Free memory was 290.2MB in the beginning and 320.7MB in the end (delta: -30.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.0GB. [2023-08-24 13:01:12,697 INFO L158 Benchmark]: TraceAbstraction took 844614.92ms. Allocated memory was 350.2MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 320.7MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-24 13:01:12,699 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 350.2MB. Free memory was 327.0MB in the beginning and 327.0MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 606.75ms. Allocated memory is still 350.2MB. Free memory was 325.2MB in the beginning and 295.5MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.05ms. Allocated memory is still 350.2MB. Free memory was 295.5MB in the beginning and 292.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.63ms. Allocated memory is still 350.2MB. Free memory was 292.6MB in the beginning and 290.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 632.60ms. Allocated memory is still 350.2MB. Free memory was 290.2MB in the beginning and 320.7MB in the end (delta: -30.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.0GB. * TraceAbstraction took 844614.92ms. Allocated memory was 350.2MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 320.7MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 203 PlacesBefore, 63 PlacesAfterwards, 244 TransitionsBefore, 97 TransitionsAfterwards, 19734 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 129 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 24 ConcurrentYvCompositions, 7 ChoiceCompositions, 188 TotalNumberOfCompositions, 31732 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14548, independent: 14140, independent conditional: 0, independent unconditional: 14140, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9383, independent: 9299, independent conditional: 0, independent unconditional: 9299, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14548, independent: 4841, independent conditional: 0, independent unconditional: 4841, dependent: 324, dependent conditional: 0, dependent unconditional: 324, unknown: 9383, unknown conditional: 0, unknown unconditional: 9383] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.1s, 203 PlacesBefore, 63 PlacesAfterwards, 244 TransitionsBefore, 97 TransitionsAfterwards, 19734 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 130 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 24 ConcurrentYvCompositions, 7 ChoiceCompositions, 189 TotalNumberOfCompositions, 31788 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14555, independent: 14146, independent conditional: 0, independent unconditional: 14146, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9566, independent: 9457, independent conditional: 0, independent unconditional: 9457, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14555, independent: 4689, independent conditional: 0, independent unconditional: 4689, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 9566, unknown conditional: 0, unknown unconditional: 9566] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 317, Positive conditional cache size: 0, Positive unconditional cache size: 317, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.2s, 265 PlacesBefore, 87 PlacesAfterwards, 320 TransitionsBefore, 133 TransitionsAfterwards, 50508 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 169 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 39 ConcurrentYvCompositions, 9 ChoiceCompositions, 245 TotalNumberOfCompositions, 78898 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35794, independent: 35317, independent conditional: 0, independent unconditional: 35317, dependent: 477, dependent conditional: 0, dependent unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23940, independent: 23813, independent conditional: 0, independent unconditional: 23813, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35794, independent: 11504, independent conditional: 0, independent unconditional: 11504, dependent: 350, dependent conditional: 0, dependent unconditional: 350, unknown: 23940, unknown conditional: 0, unknown unconditional: 23940] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 459, Positive conditional cache size: 0, Positive unconditional cache size: 459, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 196/565 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2714 conditions, 570 events (242/569 cut-off events. For 4508/4510 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3885 event pairs, 63 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 2664. Up to 190 conditions per place.). - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 196/565 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2714 conditions, 570 events (242/569 cut-off events. For 4508/4510 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3885 event pairs, 63 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 2664. Up to 190 conditions per place.). - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 196/565 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 2714 conditions, 570 events (242/569 cut-off events. For 4508/4510 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3885 event pairs, 63 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 2664. Up to 190 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 261 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 263.1s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 199.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 50 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 70.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 69.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 952 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1329 IncrementalHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1 mSDtfsCounter, 1329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 146 SyntacticMatches, 16 SemanticMatches, 125 ConstructedPredicates, 10 IntricatePredicates, 8 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 183.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 58.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 71 QuantifiedInterpolants, 6402 SizeOfPredicates, 23 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 355/403 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 317 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 547.0s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 406.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 37.2s, HoareTripleCheckerStatistics: 90 mSolverCounterUnknown, 3001 SdHoareTripleChecker+Valid, 246.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3001 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 244.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2031 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8502 IncrementalHoareTripleChecker+Invalid, 10825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 4 mSDtfsCounter, 8502 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 468 SyntacticMatches, 13 SemanticMatches, 250 ConstructedPredicates, 12 IntricatePredicates, 4 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 190.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2806occurred in iteration=17, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 98.1s InterpolantComputationTime, 815 NumberOfCodeBlocks, 769 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 988 ConstructedInterpolants, 134 QuantifiedInterpolants, 12201 SizeOfPredicates, 103 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 1650/1744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 261 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown