/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:30:11,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:30:11,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:30:11,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:30:11,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:30:11,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:30:11,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:30:11,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:30:11,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:30:11,467 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:30:11,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:30:11,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:30:11,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:30:11,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:30:11,471 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:30:11,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:30:11,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:30:11,472 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:30:11,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:30:11,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:30:11,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:30:11,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:30:11,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:30:11,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:30:11,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:30:11,474 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:30:11,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:30:11,474 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:30:11,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:30:11,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:30:11,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:30:11,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:30:11,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:30:11,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:30:11,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:30:11,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:30:11,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:30:11,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:30:11,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:30:11,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:30:11,479 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:30:11,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:30:11,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:30:11,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:30:11,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:30:11,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:30:11,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:30:11,752 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:30:11,752 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:30:11,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2023-12-16 04:30:12,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:30:13,117 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:30:13,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2023-12-16 04:30:13,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf4550f2/0be7d17c5906496f9819b09ede277d2a/FLAGaf35151fd [2023-12-16 04:30:13,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf4550f2/0be7d17c5906496f9819b09ede277d2a [2023-12-16 04:30:13,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:30:13,140 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:30:13,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:30:13,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:30:13,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:30:13,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6175b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13, skipping insertion in model container [2023-12-16 04:30:13,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:30:13,318 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2023-12-16 04:30:13,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:30:13,391 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:30:13,407 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2023-12-16 04:30:13,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:30:13,496 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:30:13,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13 WrapperNode [2023-12-16 04:30:13,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:30:13,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:30:13,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:30:13,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:30:13,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,561 INFO L138 Inliner]: procedures = 29, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2023-12-16 04:30:13,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:30:13,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:30:13,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:30:13,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:30:13,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,601 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 19 writes are split as follows [0, 19]. [2023-12-16 04:30:13,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:30:13,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:30:13,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:30:13,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:30:13,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (1/1) ... [2023-12-16 04:30:13,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:30:13,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:13,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:30:13,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:30:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:30:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:30:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:30:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:30:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:30:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:30:13,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:30:13,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:30:13,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:30:13,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:30:13,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:30:13,823 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:30:13,824 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:30:14,242 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:30:14,272 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:30:14,272 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:30:14,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:14 BoogieIcfgContainer [2023-12-16 04:30:14,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:30:14,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:30:14,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:30:14,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:30:14,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:30:13" (1/3) ... [2023-12-16 04:30:14,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa3e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:14, skipping insertion in model container [2023-12-16 04:30:14,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:13" (2/3) ... [2023-12-16 04:30:14,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa3e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:14, skipping insertion in model container [2023-12-16 04:30:14,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:14" (3/3) ... [2023-12-16 04:30:14,280 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2023-12-16 04:30:14,297 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:30:14,297 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:30:14,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:30:14,339 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7d46536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:30:14,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:30:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:30:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:30:14,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:14,355 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:14,356 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:14,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:14,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1242685372, now seen corresponding path program 1 times [2023-12-16 04:30:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:14,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436178911] [2023-12-16 04:30:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436178911] [2023-12-16 04:30:14,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436178911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:14,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:14,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:30:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834002845] [2023-12-16 04:30:14,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:30:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:14,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:30:14,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:30:14,823 INFO L87 Difference]: Start difference. First operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:14,879 INFO L93 Difference]: Finished difference Result 205 states and 327 transitions. [2023-12-16 04:30:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:30:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2023-12-16 04:30:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:14,887 INFO L225 Difference]: With dead ends: 205 [2023-12-16 04:30:14,888 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:30:14,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:30:14,895 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:14,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:30:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 04:30:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:30:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2023-12-16 04:30:14,936 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 134 [2023-12-16 04:30:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:14,936 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2023-12-16 04:30:14,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2023-12-16 04:30:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:30:14,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:14,943 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:14,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:30:14,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:14,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1448233006, now seen corresponding path program 1 times [2023-12-16 04:30:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49117659] [2023-12-16 04:30:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49117659] [2023-12-16 04:30:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49117659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:15,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135970925] [2023-12-16 04:30:15,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:15,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:15,347 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:15,440 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2023-12-16 04:30:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:15,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-16 04:30:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:15,447 INFO L225 Difference]: With dead ends: 215 [2023-12-16 04:30:15,447 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 04:30:15,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:15,449 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 21 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:15,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 04:30:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2023-12-16 04:30:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:30:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2023-12-16 04:30:15,464 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 134 [2023-12-16 04:30:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:15,468 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2023-12-16 04:30:15,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2023-12-16 04:30:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:30:15,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:15,474 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:15,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:30:15,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:15,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 638886380, now seen corresponding path program 1 times [2023-12-16 04:30:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:15,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822120719] [2023-12-16 04:30:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:15,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:15,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822120719] [2023-12-16 04:30:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822120719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:15,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:15,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:15,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116377127] [2023-12-16 04:30:15,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:15,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:15,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:15,716 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:15,766 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2023-12-16 04:30:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:15,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-16 04:30:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:15,772 INFO L225 Difference]: With dead ends: 211 [2023-12-16 04:30:15,773 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 04:30:15,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:15,781 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:15,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 430 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 04:30:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-12-16 04:30:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:30:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2023-12-16 04:30:15,797 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 134 [2023-12-16 04:30:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:15,797 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2023-12-16 04:30:15,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2023-12-16 04:30:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:30:15,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:15,799 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:15,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:30:15,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:15,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 638945962, now seen corresponding path program 1 times [2023-12-16 04:30:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:15,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465106908] [2023-12-16 04:30:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:16,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465106908] [2023-12-16 04:30:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465106908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:16,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:16,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:30:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282080973] [2023-12-16 04:30:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:16,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:16,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:16,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:16,537 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:16,828 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2023-12-16 04:30:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-16 04:30:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:16,830 INFO L225 Difference]: With dead ends: 256 [2023-12-16 04:30:16,830 INFO L226 Difference]: Without dead ends: 151 [2023-12-16 04:30:16,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:30:16,831 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:16,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 369 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-16 04:30:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2023-12-16 04:30:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 97 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:30:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2023-12-16 04:30:16,843 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 134 [2023-12-16 04:30:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:16,843 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2023-12-16 04:30:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2023-12-16 04:30:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 04:30:16,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:16,845 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:16,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:30:16,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:16,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1692378424, now seen corresponding path program 1 times [2023-12-16 04:30:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337814610] [2023-12-16 04:30:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:17,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:17,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337814610] [2023-12-16 04:30:17,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337814610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:17,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:17,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:30:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208553784] [2023-12-16 04:30:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:17,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:17,159 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:17,243 INFO L93 Difference]: Finished difference Result 258 states and 369 transitions. [2023-12-16 04:30:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-16 04:30:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:17,246 INFO L225 Difference]: With dead ends: 258 [2023-12-16 04:30:17,246 INFO L226 Difference]: Without dead ends: 147 [2023-12-16 04:30:17,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:17,247 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 89 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:17,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 588 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:30:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-16 04:30:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 123. [2023-12-16 04:30:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 100 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:30:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2023-12-16 04:30:17,257 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 136 [2023-12-16 04:30:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:17,257 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2023-12-16 04:30:17,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2023-12-16 04:30:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:30:17,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:17,259 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:17,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:30:17,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:17,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash -486595688, now seen corresponding path program 1 times [2023-12-16 04:30:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546135710] [2023-12-16 04:30:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:17,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546135710] [2023-12-16 04:30:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546135710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842303675] [2023-12-16 04:30:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:17,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:17,984 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:18,267 INFO L93 Difference]: Finished difference Result 271 states and 384 transitions. [2023-12-16 04:30:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:30:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-12-16 04:30:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:18,269 INFO L225 Difference]: With dead ends: 271 [2023-12-16 04:30:18,269 INFO L226 Difference]: Without dead ends: 157 [2023-12-16 04:30:18,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:30:18,270 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 164 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:18,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 488 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-16 04:30:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 121. [2023-12-16 04:30:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 98 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:30:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 172 transitions. [2023-12-16 04:30:18,285 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 172 transitions. Word has length 137 [2023-12-16 04:30:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:18,286 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 172 transitions. [2023-12-16 04:30:18,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 172 transitions. [2023-12-16 04:30:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:30:18,287 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:18,288 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:18,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:30:18,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:18,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1670602573, now seen corresponding path program 1 times [2023-12-16 04:30:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304614634] [2023-12-16 04:30:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304614634] [2023-12-16 04:30:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304614634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:30:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405622340] [2023-12-16 04:30:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:18,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:18,695 INFO L87 Difference]: Start difference. First operand 121 states and 172 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:19,002 INFO L93 Difference]: Finished difference Result 352 states and 495 transitions. [2023-12-16 04:30:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-16 04:30:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:19,004 INFO L225 Difference]: With dead ends: 352 [2023-12-16 04:30:19,004 INFO L226 Difference]: Without dead ends: 240 [2023-12-16 04:30:19,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:19,006 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 164 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:19,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 505 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-16 04:30:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 125. [2023-12-16 04:30:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 102 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:30:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2023-12-16 04:30:19,014 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 138 [2023-12-16 04:30:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:19,015 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2023-12-16 04:30:19,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2023-12-16 04:30:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:30:19,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:19,016 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:19,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:30:19,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:19,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1247900747, now seen corresponding path program 1 times [2023-12-16 04:30:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390551436] [2023-12-16 04:30:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:20,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:20,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390551436] [2023-12-16 04:30:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390551436] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018199453] [2023-12-16 04:30:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:20,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:20,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:20,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:20,336 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:20,671 INFO L93 Difference]: Finished difference Result 326 states and 461 transitions. [2023-12-16 04:30:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-16 04:30:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:20,673 INFO L225 Difference]: With dead ends: 326 [2023-12-16 04:30:20,673 INFO L226 Difference]: Without dead ends: 210 [2023-12-16 04:30:20,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:20,675 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 183 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:20,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 407 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-16 04:30:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2023-12-16 04:30:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 124 states have internal predecessors, (170), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:30:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2023-12-16 04:30:20,683 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 138 [2023-12-16 04:30:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:20,683 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2023-12-16 04:30:20,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2023-12-16 04:30:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:30:20,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:20,685 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:20,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:30:20,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:20,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash -546300873, now seen corresponding path program 1 times [2023-12-16 04:30:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193845002] [2023-12-16 04:30:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:20,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193845002] [2023-12-16 04:30:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193845002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068656748] [2023-12-16 04:30:21,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:21,860 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:22,166 INFO L93 Difference]: Finished difference Result 382 states and 550 transitions. [2023-12-16 04:30:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-16 04:30:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:22,168 INFO L225 Difference]: With dead ends: 382 [2023-12-16 04:30:22,169 INFO L226 Difference]: Without dead ends: 244 [2023-12-16 04:30:22,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:22,170 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 121 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:22,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 458 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-16 04:30:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 147. [2023-12-16 04:30:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 124 states have internal predecessors, (170), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:30:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2023-12-16 04:30:22,180 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 138 [2023-12-16 04:30:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:22,180 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2023-12-16 04:30:22,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2023-12-16 04:30:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:30:22,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:22,182 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:22,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:30:22,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:22,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1922807758, now seen corresponding path program 1 times [2023-12-16 04:30:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430727535] [2023-12-16 04:30:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430727535] [2023-12-16 04:30:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430727535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:23,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:23,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:30:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870791740] [2023-12-16 04:30:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:23,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:30:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:30:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:30:23,565 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-16 04:30:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:23,994 INFO L93 Difference]: Finished difference Result 381 states and 541 transitions. [2023-12-16 04:30:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:30:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2023-12-16 04:30:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:23,996 INFO L225 Difference]: With dead ends: 381 [2023-12-16 04:30:23,996 INFO L226 Difference]: Without dead ends: 243 [2023-12-16 04:30:23,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:30:23,997 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 149 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:23,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 766 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:30:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-16 04:30:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 227. [2023-12-16 04:30:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 195 states have internal predecessors, (263), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-16 04:30:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 321 transitions. [2023-12-16 04:30:24,013 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 321 transitions. Word has length 139 [2023-12-16 04:30:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:24,014 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 321 transitions. [2023-12-16 04:30:24,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-16 04:30:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 321 transitions. [2023-12-16 04:30:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:30:24,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:24,033 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:30:24,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:24,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1041677922, now seen corresponding path program 1 times [2023-12-16 04:30:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028758310] [2023-12-16 04:30:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028758310] [2023-12-16 04:30:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028758310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:25,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:25,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:30:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973780281] [2023-12-16 04:30:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:25,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:25,191 INFO L87 Difference]: Start difference. First operand 227 states and 321 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:25,516 INFO L93 Difference]: Finished difference Result 720 states and 1008 transitions. [2023-12-16 04:30:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:30:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:25,520 INFO L225 Difference]: With dead ends: 720 [2023-12-16 04:30:25,520 INFO L226 Difference]: Without dead ends: 502 [2023-12-16 04:30:25,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:25,521 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 162 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:25,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 495 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-16 04:30:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 253. [2023-12-16 04:30:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 223 states have (on average 1.3946188340807175) internal successors, (311), 224 states have internal predecessors, (311), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-16 04:30:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 361 transitions. [2023-12-16 04:30:25,538 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 361 transitions. Word has length 140 [2023-12-16 04:30:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:25,538 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 361 transitions. [2023-12-16 04:30:25,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 361 transitions. [2023-12-16 04:30:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:30:25,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:25,541 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:25,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:30:25,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:25,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2062746276, now seen corresponding path program 1 times [2023-12-16 04:30:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036213875] [2023-12-16 04:30:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-12-16 04:30:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:29,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036213875] [2023-12-16 04:30:29,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036213875] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:29,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78705936] [2023-12-16 04:30:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:29,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:29,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:29,020 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-12-16 04:30:29,024 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-12-16 04:30:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:29,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 04:30:29,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:29,438 INFO L378 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 76 treesize of output 55 [2023-12-16 04:30:29,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2023-12-16 04:30:29,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 28 [2023-12-16 04:30:29,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:29,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 71 [2023-12-16 04:30:29,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:29,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 77 [2023-12-16 04:30:29,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:29,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 38 [2023-12-16 04:30:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:30,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78705936] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:30:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23, 12] total 31 [2023-12-16 04:30:30,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431800285] [2023-12-16 04:30:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:30,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:30:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:30:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2023-12-16 04:30:30,452 INFO L87 Difference]: Start difference. First operand 253 states and 361 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:31,455 INFO L93 Difference]: Finished difference Result 750 states and 1051 transitions. [2023-12-16 04:30:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:30:31,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:30:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:31,458 INFO L225 Difference]: With dead ends: 750 [2023-12-16 04:30:31,458 INFO L226 Difference]: Without dead ends: 498 [2023-12-16 04:30:31,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 04:30:31,460 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 235 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:31,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1198 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-16 04:30:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 386. [2023-12-16 04:30:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 340 states have (on average 1.3647058823529412) internal successors, (464), 343 states have internal predecessors, (464), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:30:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 538 transitions. [2023-12-16 04:30:31,480 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 538 transitions. Word has length 140 [2023-12-16 04:30:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:31,480 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 538 transitions. [2023-12-16 04:30:31,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 538 transitions. [2023-12-16 04:30:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:30:31,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:31,482 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:31,498 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-12-16 04:30:31,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 04:30:31,689 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:31,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1867085980, now seen corresponding path program 1 times [2023-12-16 04:30:31,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:31,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288407579] [2023-12-16 04:30:31,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288407579] [2023-12-16 04:30:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288407579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658354709] [2023-12-16 04:30:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:34,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:34,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:34,663 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-12-16 04:30:34,689 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-12-16 04:30:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:34,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 04:30:34,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:34,911 INFO L378 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 17 treesize of output 17 [2023-12-16 04:30:34,957 INFO L378 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 89 treesize of output 65 [2023-12-16 04:30:34,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:34,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 83 [2023-12-16 04:30:34,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2023-12-16 04:30:35,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:35,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 84 [2023-12-16 04:30:35,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:35,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 90 [2023-12-16 04:30:35,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:35,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 44 [2023-12-16 04:30:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:35,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658354709] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:36,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:30:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 15] total 32 [2023-12-16 04:30:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010484690] [2023-12-16 04:30:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:36,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:30:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:30:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2023-12-16 04:30:36,057 INFO L87 Difference]: Start difference. First operand 386 states and 538 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:37,809 INFO L93 Difference]: Finished difference Result 1227 states and 1691 transitions. [2023-12-16 04:30:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-16 04:30:37,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:30:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:37,815 INFO L225 Difference]: With dead ends: 1227 [2023-12-16 04:30:37,815 INFO L226 Difference]: Without dead ends: 842 [2023-12-16 04:30:37,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=2125, Unknown=0, NotChecked=0, Total=2450 [2023-12-16 04:30:37,818 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 364 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:37,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1389 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 04:30:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2023-12-16 04:30:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 396. [2023-12-16 04:30:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 350 states have (on average 1.3657142857142857) internal successors, (478), 353 states have internal predecessors, (478), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:30:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 552 transitions. [2023-12-16 04:30:37,849 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 552 transitions. Word has length 140 [2023-12-16 04:30:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:37,849 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 552 transitions. [2023-12-16 04:30:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 552 transitions. [2023-12-16 04:30:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:30:37,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:37,852 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:37,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-16 04:30:38,058 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,SelfDestructingSolverStorable12 [2023-12-16 04:30:38,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:38,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash 846017626, now seen corresponding path program 1 times [2023-12-16 04:30:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424158] [2023-12-16 04:30:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424158] [2023-12-16 04:30:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:39,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:30:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538202534] [2023-12-16 04:30:39,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:39,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:30:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:30:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:39,184 INFO L87 Difference]: Start difference. First operand 396 states and 552 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-16 04:30:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:39,736 INFO L93 Difference]: Finished difference Result 966 states and 1339 transitions. [2023-12-16 04:30:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:30:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2023-12-16 04:30:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:39,756 INFO L225 Difference]: With dead ends: 966 [2023-12-16 04:30:39,756 INFO L226 Difference]: Without dead ends: 571 [2023-12-16 04:30:39,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:30:39,757 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 109 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:39,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 795 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:30:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2023-12-16 04:30:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 396. [2023-12-16 04:30:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 350 states have (on average 1.3542857142857143) internal successors, (474), 353 states have internal predecessors, (474), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:30:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 548 transitions. [2023-12-16 04:30:39,797 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 548 transitions. Word has length 140 [2023-12-16 04:30:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:39,797 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 548 transitions. [2023-12-16 04:30:39,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-16 04:30:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 548 transitions. [2023-12-16 04:30:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:30:39,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:39,799 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:39,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:30:39,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:39,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash -164913097, now seen corresponding path program 1 times [2023-12-16 04:30:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781850130] [2023-12-16 04:30:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:39,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:39,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781850130] [2023-12-16 04:30:39,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781850130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:39,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:30:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047943898] [2023-12-16 04:30:39,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:39,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:30:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:39,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:30:39,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:30:39,920 INFO L87 Difference]: Start difference. First operand 396 states and 548 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:39,954 INFO L93 Difference]: Finished difference Result 795 states and 1103 transitions. [2023-12-16 04:30:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:30:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2023-12-16 04:30:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:39,960 INFO L225 Difference]: With dead ends: 795 [2023-12-16 04:30:39,960 INFO L226 Difference]: Without dead ends: 400 [2023-12-16 04:30:39,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:30:39,962 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:39,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-16 04:30:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2023-12-16 04:30:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 354 states have (on average 1.3502824858757063) internal successors, (478), 357 states have internal predecessors, (478), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:30:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 552 transitions. [2023-12-16 04:30:39,983 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 552 transitions. Word has length 141 [2023-12-16 04:30:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:39,983 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 552 transitions. [2023-12-16 04:30:39,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 552 transitions. [2023-12-16 04:30:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:30:39,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:39,985 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:39,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:30:39,985 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:39,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash 489565101, now seen corresponding path program 1 times [2023-12-16 04:30:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654305704] [2023-12-16 04:30:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654305704] [2023-12-16 04:30:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654305704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:40,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:30:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023394927] [2023-12-16 04:30:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:40,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:30:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:30:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:30:40,068 INFO L87 Difference]: Start difference. First operand 400 states and 552 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:40,096 INFO L93 Difference]: Finished difference Result 865 states and 1195 transitions. [2023-12-16 04:30:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:30:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2023-12-16 04:30:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:40,099 INFO L225 Difference]: With dead ends: 865 [2023-12-16 04:30:40,099 INFO L226 Difference]: Without dead ends: 466 [2023-12-16 04:30:40,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:30:40,100 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 20 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:40,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 285 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-12-16 04:30:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 404. [2023-12-16 04:30:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 358 states have (on average 1.3463687150837989) internal successors, (482), 361 states have internal predecessors, (482), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:30:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2023-12-16 04:30:40,119 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 141 [2023-12-16 04:30:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:40,120 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2023-12-16 04:30:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2023-12-16 04:30:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:30:40,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:40,122 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:30:40,122 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:40,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2610206, now seen corresponding path program 1 times [2023-12-16 04:30:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073756686] [2023-12-16 04:30:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:40,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:40,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073756686] [2023-12-16 04:30:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073756686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:30:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278319119] [2023-12-16 04:30:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:40,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:40,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:40,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:40,430 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:40,709 INFO L93 Difference]: Finished difference Result 910 states and 1257 transitions. [2023-12-16 04:30:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:40,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2023-12-16 04:30:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:40,711 INFO L225 Difference]: With dead ends: 910 [2023-12-16 04:30:40,712 INFO L226 Difference]: Without dead ends: 507 [2023-12-16 04:30:40,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:40,713 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 125 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:40,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 508 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-12-16 04:30:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 412. [2023-12-16 04:30:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 366 states have (on average 1.3387978142076502) internal successors, (490), 369 states have internal predecessors, (490), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:30:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 564 transitions. [2023-12-16 04:30:40,738 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 564 transitions. Word has length 141 [2023-12-16 04:30:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:40,738 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 564 transitions. [2023-12-16 04:30:40,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 564 transitions. [2023-12-16 04:30:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:30:40,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:40,741 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:40,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:30:40,741 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:40,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash -59928090, now seen corresponding path program 1 times [2023-12-16 04:30:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:40,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998406589] [2023-12-16 04:30:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:40,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998406589] [2023-12-16 04:30:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998406589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846047661] [2023-12-16 04:30:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:41,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:41,454 INFO L87 Difference]: Start difference. First operand 412 states and 564 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:41,895 INFO L93 Difference]: Finished difference Result 466 states and 637 transitions. [2023-12-16 04:30:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:41,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2023-12-16 04:30:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:41,898 INFO L225 Difference]: With dead ends: 466 [2023-12-16 04:30:41,898 INFO L226 Difference]: Without dead ends: 464 [2023-12-16 04:30:41,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:30:41,901 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 92 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:41,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 563 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:30:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-12-16 04:30:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 463. [2023-12-16 04:30:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 400 states have (on average 1.3175) internal successors, (527), 404 states have internal predecessors, (527), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:30:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 631 transitions. [2023-12-16 04:30:41,939 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 631 transitions. Word has length 141 [2023-12-16 04:30:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:41,941 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 631 transitions. [2023-12-16 04:30:41,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 631 transitions. [2023-12-16 04:30:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:30:41,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:41,943 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:41,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:30:41,944 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:41,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash -59868508, now seen corresponding path program 1 times [2023-12-16 04:30:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052262173] [2023-12-16 04:30:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052262173] [2023-12-16 04:30:42,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052262173] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471366424] [2023-12-16 04:30:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:42,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:42,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:42,985 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-12-16 04:30:43,008 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-12-16 04:30:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:43,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 04:30:43,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:43,410 INFO L378 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 25 treesize of output 13 [2023-12-16 04:30:43,448 INFO L378 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 25 treesize of output 13 [2023-12-16 04:30:43,484 INFO L378 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 25 treesize of output 13 [2023-12-16 04:30:43,520 INFO L378 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 25 treesize of output 13 [2023-12-16 04:30:43,556 INFO L378 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 25 treesize of output 13 [2023-12-16 04:30:43,595 INFO L378 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 25 treesize of output 13 [2023-12-16 04:30:43,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-16 04:30:43,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-16 04:30:43,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-16 04:30:43,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 39 [2023-12-16 04:30:43,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 17 [2023-12-16 04:30:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 258 proven. 15 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2023-12-16 04:30:44,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471366424] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:30:44,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:30:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2023-12-16 04:30:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066185289] [2023-12-16 04:30:44,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:30:44,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 04:30:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 04:30:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:30:44,319 INFO L87 Difference]: Start difference. First operand 463 states and 631 transitions. Second operand has 23 states, 19 states have (on average 6.842105263157895) internal successors, (130), 23 states have internal predecessors, (130), 11 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 7 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-16 04:30:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:45,908 INFO L93 Difference]: Finished difference Result 1110 states and 1494 transitions. [2023-12-16 04:30:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:30:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.842105263157895) internal successors, (130), 23 states have internal predecessors, (130), 11 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 7 states have call predecessors, (51), 11 states have call successors, (51) Word has length 141 [2023-12-16 04:30:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:45,928 INFO L225 Difference]: With dead ends: 1110 [2023-12-16 04:30:45,928 INFO L226 Difference]: Without dead ends: 687 [2023-12-16 04:30:45,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 04:30:45,930 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 456 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:45,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 631 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 04:30:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-16 04:30:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 657. [2023-12-16 04:30:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 562 states have (on average 1.3060498220640568) internal successors, (734), 567 states have internal predecessors, (734), 77 states have call successors, (77), 17 states have call predecessors, (77), 17 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-16 04:30:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 888 transitions. [2023-12-16 04:30:45,992 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 888 transitions. Word has length 141 [2023-12-16 04:30:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:45,992 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 888 transitions. [2023-12-16 04:30:45,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.842105263157895) internal successors, (130), 23 states have internal predecessors, (130), 11 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 7 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-16 04:30:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 888 transitions. [2023-12-16 04:30:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:30:45,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:45,994 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:46,002 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-12-16 04:30:46,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:46,202 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:46,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1603793183, now seen corresponding path program 1 times [2023-12-16 04:30:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:46,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897811686] [2023-12-16 04:30:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:46,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:47,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897811686] [2023-12-16 04:30:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897811686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:47,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:47,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:30:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173496535] [2023-12-16 04:30:47,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:30:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:47,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:30:47,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:47,474 INFO L87 Difference]: Start difference. First operand 657 states and 888 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:48,202 INFO L93 Difference]: Finished difference Result 1302 states and 1751 transitions. [2023-12-16 04:30:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:30:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:48,206 INFO L225 Difference]: With dead ends: 1302 [2023-12-16 04:30:48,206 INFO L226 Difference]: Without dead ends: 689 [2023-12-16 04:30:48,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:48,209 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 151 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:48,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 442 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-12-16 04:30:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 665. [2023-12-16 04:30:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 568 states have (on average 1.2992957746478873) internal successors, (738), 573 states have internal predecessors, (738), 77 states have call successors, (77), 19 states have call predecessors, (77), 19 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-16 04:30:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 892 transitions. [2023-12-16 04:30:48,278 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 892 transitions. Word has length 143 [2023-12-16 04:30:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:48,278 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 892 transitions. [2023-12-16 04:30:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 892 transitions. [2023-12-16 04:30:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:30:48,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:48,280 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:48,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:30:48,280 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:48,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2115444573, now seen corresponding path program 1 times [2023-12-16 04:30:48,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:48,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879266553] [2023-12-16 04:30:48,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879266553] [2023-12-16 04:30:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879266553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961008755] [2023-12-16 04:30:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:49,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:49,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:49,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:49,022 INFO L87 Difference]: Start difference. First operand 665 states and 892 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:49,309 INFO L93 Difference]: Finished difference Result 1269 states and 1700 transitions. [2023-12-16 04:30:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:30:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:49,316 INFO L225 Difference]: With dead ends: 1269 [2023-12-16 04:30:49,316 INFO L226 Difference]: Without dead ends: 846 [2023-12-16 04:30:49,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:49,318 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:49,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 395 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2023-12-16 04:30:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 638. [2023-12-16 04:30:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 541 states have (on average 1.2828096118299446) internal successors, (694), 546 states have internal predecessors, (694), 77 states have call successors, (77), 19 states have call predecessors, (77), 19 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-16 04:30:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 848 transitions. [2023-12-16 04:30:49,377 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 848 transitions. Word has length 143 [2023-12-16 04:30:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:49,378 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 848 transitions. [2023-12-16 04:30:49,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 848 transitions. [2023-12-16 04:30:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:30:49,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:49,380 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:30:49,380 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:49,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1721077787, now seen corresponding path program 1 times [2023-12-16 04:30:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:49,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887225836] [2023-12-16 04:30:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:50,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887225836] [2023-12-16 04:30:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887225836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:50,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:50,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006513770] [2023-12-16 04:30:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:50,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:50,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:50,254 INFO L87 Difference]: Start difference. First operand 638 states and 848 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:50,763 INFO L93 Difference]: Finished difference Result 1385 states and 1831 transitions. [2023-12-16 04:30:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:30:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:50,768 INFO L225 Difference]: With dead ends: 1385 [2023-12-16 04:30:50,768 INFO L226 Difference]: Without dead ends: 989 [2023-12-16 04:30:50,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:50,770 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 130 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:50,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 625 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:30:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2023-12-16 04:30:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 632. [2023-12-16 04:30:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 535 states have (on average 1.2785046728971963) internal successors, (684), 540 states have internal predecessors, (684), 77 states have call successors, (77), 19 states have call predecessors, (77), 19 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-16 04:30:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 838 transitions. [2023-12-16 04:30:50,830 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 838 transitions. Word has length 143 [2023-12-16 04:30:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:50,830 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 838 transitions. [2023-12-16 04:30:50,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 838 transitions. [2023-12-16 04:30:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:30:50,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:50,832 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:50,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:30:50,832 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:50,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1587064281, now seen corresponding path program 1 times [2023-12-16 04:30:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407800406] [2023-12-16 04:30:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:51,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:51,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407800406] [2023-12-16 04:30:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407800406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231142669] [2023-12-16 04:30:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:51,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:51,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:51,820 INFO L87 Difference]: Start difference. First operand 632 states and 838 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:52,270 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2023-12-16 04:30:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:30:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:52,273 INFO L225 Difference]: With dead ends: 1097 [2023-12-16 04:30:52,273 INFO L226 Difference]: Without dead ends: 707 [2023-12-16 04:30:52,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:52,275 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 98 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:52,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 526 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-12-16 04:30:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 632. [2023-12-16 04:30:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 535 states have (on average 1.2672897196261683) internal successors, (678), 540 states have internal predecessors, (678), 77 states have call successors, (77), 19 states have call predecessors, (77), 19 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-16 04:30:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 832 transitions. [2023-12-16 04:30:52,384 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 832 transitions. Word has length 143 [2023-12-16 04:30:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:52,384 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 832 transitions. [2023-12-16 04:30:52,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:30:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 832 transitions. [2023-12-16 04:30:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:30:52,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:52,386 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:52,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 04:30:52,386 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:52,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2119522214, now seen corresponding path program 1 times [2023-12-16 04:30:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777378853] [2023-12-16 04:30:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:30:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:30:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:30:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777378853] [2023-12-16 04:30:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777378853] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914066129] [2023-12-16 04:30:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:56,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:56,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:56,272 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-12-16 04:30:56,275 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-12-16 04:30:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:56,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-16 04:30:56,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:56,584 INFO L378 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 17 treesize of output 17 [2023-12-16 04:30:56,657 INFO L378 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 89 treesize of output 65 [2023-12-16 04:30:56,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 83 [2023-12-16 04:30:56,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 40 [2023-12-16 04:30:56,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:56,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 75 [2023-12-16 04:30:56,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:56,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 78 [2023-12-16 04:30:57,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:57,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 41 [2023-12-16 04:30:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:30:57,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:30:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914066129] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:58,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:30:58,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [22, 16] total 39 [2023-12-16 04:30:58,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605049315] [2023-12-16 04:30:58,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:58,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:30:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:58,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:30:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 04:30:58,014 INFO L87 Difference]: Start difference. First operand 632 states and 832 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:59,551 INFO L93 Difference]: Finished difference Result 1121 states and 1473 transitions. [2023-12-16 04:30:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:30:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-12-16 04:30:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:59,555 INFO L225 Difference]: With dead ends: 1121 [2023-12-16 04:30:59,555 INFO L226 Difference]: Without dead ends: 731 [2023-12-16 04:30:59,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=321, Invalid=2331, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 04:30:59,558 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 286 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:59,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1201 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:30:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2023-12-16 04:30:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 616. [2023-12-16 04:30:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 519 states have (on average 1.2716763005780347) internal successors, (660), 524 states have internal predecessors, (660), 77 states have call successors, (77), 19 states have call predecessors, (77), 19 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-16 04:30:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 814 transitions. [2023-12-16 04:30:59,629 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 814 transitions. Word has length 143 [2023-12-16 04:30:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:59,630 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 814 transitions. [2023-12-16 04:30:59,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:30:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 814 transitions. [2023-12-16 04:30:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:30:59,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:59,631 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:59,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-16 04:30:59,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:59,839 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:59,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -695908179, now seen corresponding path program 1 times [2023-12-16 04:30:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854974567] [2023-12-16 04:30:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 04:31:00,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:31:00,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 04:31:00,690 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 146 with TraceHistMax 17,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 144 interpolants. [2023-12-16 04:31:00,694 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:00,699 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:31:00,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:31:00 BoogieIcfgContainer [2023-12-16 04:31:00,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:31:00,702 INFO L158 Benchmark]: Toolchain (without parser) took 47562.34ms. Allocated memory was 162.5MB in the beginning and 848.3MB in the end (delta: 685.8MB). Free memory was 109.3MB in the beginning and 764.8MB in the end (delta: -655.5MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2023-12-16 04:31:00,702 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 162.5MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:31:00,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.95ms. Allocated memory is still 162.5MB. Free memory was 109.3MB in the beginning and 92.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 04:31:00,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.80ms. Allocated memory is still 162.5MB. Free memory was 92.4MB in the beginning and 88.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:31:00,703 INFO L158 Benchmark]: Boogie Preprocessor took 89.81ms. Allocated memory is still 162.5MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:31:00,708 INFO L158 Benchmark]: RCFGBuilder took 620.27ms. Allocated memory was 162.5MB in the beginning and 195.0MB in the end (delta: 32.5MB). Free memory was 83.7MB in the beginning and 147.9MB in the end (delta: -64.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 04:31:00,708 INFO L158 Benchmark]: TraceAbstraction took 46426.92ms. Allocated memory was 195.0MB in the beginning and 848.3MB in the end (delta: 653.3MB). Free memory was 147.4MB in the beginning and 764.8MB in the end (delta: -617.4MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2023-12-16 04:31:00,709 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 162.5MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.95ms. Allocated memory is still 162.5MB. Free memory was 109.3MB in the beginning and 92.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.80ms. Allocated memory is still 162.5MB. Free memory was 92.4MB in the beginning and 88.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.81ms. Allocated memory is still 162.5MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 620.27ms. Allocated memory was 162.5MB in the beginning and 195.0MB in the end (delta: 32.5MB). Free memory was 83.7MB in the beginning and 147.9MB in the end (delta: -64.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 46426.92ms. Allocated memory was 195.0MB in the beginning and 848.3MB in the end (delta: 653.3MB). Free memory was 147.4MB in the beginning and 764.8MB in the end (delta: -617.4MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 146 with TraceHistMax 17,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 144 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.4s, OverallIterations: 25, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3450 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3424 mSDsluCounter, 13927 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10453 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9511 IncrementalHoareTripleChecker+Invalid, 9868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 3474 mSDtfsCounter, 9511 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2357 GetRequests, 2085 SyntacticMatches, 3 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1742 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=665occurred in iteration=20, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 2343 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 3906 NumberOfCodeBlocks, 3906 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4438 ConstructedInterpolants, 0 QuantifiedInterpolants, 25992 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1876 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 17126/17408 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 [2023-12-16 04:31:00,718 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown