/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:42:09,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:42:09,986 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-15 20:42:09,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:42:09,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:42:10,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:42:10,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:42:10,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:42:10,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:42:10,016 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:42:10,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:42:10,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:42:10,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:42:10,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:42:10,018 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:42:10,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:42:10,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:42:10,018 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:42:10,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:42:10,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:42:10,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:42:10,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:42:10,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:42:10,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:42:10,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:42:10,020 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:42:10,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:42:10,021 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:42:10,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:42:10,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:42:10,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:42:10,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:42:10,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:42:10,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:42:10,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:42:10,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:42:10,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:42:10,024 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 -> true [2023-12-15 20:42:10,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:42:10,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:42:10,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:42:10,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:42:10,232 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:42:10,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-15 20:42:11,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:42:11,392 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:42:11,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-15 20:42:11,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b99d15d9/1aff593f4b79487e934aef3c5aa5bc11/FLAG96d6c116a [2023-12-15 20:42:11,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b99d15d9/1aff593f4b79487e934aef3c5aa5bc11 [2023-12-15 20:42:11,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:42:11,411 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:42:11,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:42:11,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:42:11,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:42:11,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ca8348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11, skipping insertion in model container [2023-12-15 20:42:11,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,434 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:42:11,568 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_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-12-15 20:42:11,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:42:11,617 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:42:11,626 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_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-12-15 20:42:11,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:42:11,653 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:42:11,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11 WrapperNode [2023-12-15 20:42:11,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:42:11,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:42:11,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:42:11,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:42:11,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,693 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2023-12-15 20:42:11,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:42:11,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:42:11,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:42:11,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:42:11,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,723 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:42:11,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:42:11,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:42:11,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:42:11,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:42:11,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (1/1) ... [2023-12-15 20:42:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:42:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:42:11,769 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-15 20:42:11,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:42:11,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:42:11,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:42:11,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:42:11,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:42:11,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:42:11,788 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-15 20:42:11,866 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:42:11,867 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:42:12,127 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:42:12,146 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:42:12,146 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:42:12,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:42:12 BoogieIcfgContainer [2023-12-15 20:42:12,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:42:12,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:42:12,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:42:12,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:42:12,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:42:11" (1/3) ... [2023-12-15 20:42:12,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaf083a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:42:12, skipping insertion in model container [2023-12-15 20:42:12,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:11" (2/3) ... [2023-12-15 20:42:12,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaf083a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:42:12, skipping insertion in model container [2023-12-15 20:42:12,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:42:12" (3/3) ... [2023-12-15 20:42:12,152 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-15 20:42:12,162 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:42:12,162 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:42:12,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:42:12,202 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;@721e1d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:42:12,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:42:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:42:12,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:12,211 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:12,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:12,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2011261731, now seen corresponding path program 1 times [2023-12-15 20:42:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570808753] [2023-12-15 20:42:12,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570808753] [2023-12-15 20:42:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570808753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:42:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173540098] [2023-12-15 20:42:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:12,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:42:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:12,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:42:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:42:12,445 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 20:42:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:12,490 INFO L93 Difference]: Finished difference Result 111 states and 192 transitions. [2023-12-15 20:42:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:42:12,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2023-12-15 20:42:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:12,499 INFO L225 Difference]: With dead ends: 111 [2023-12-15 20:42:12,499 INFO L226 Difference]: Without dead ends: 55 [2023-12-15 20:42:12,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-15 20:42:12,503 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:12,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-15 20:42:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-15 20:42:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 86 transitions. [2023-12-15 20:42:12,537 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 86 transitions. Word has length 85 [2023-12-15 20:42:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:12,538 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 86 transitions. [2023-12-15 20:42:12,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 20:42:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 86 transitions. [2023-12-15 20:42:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:42:12,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:12,540 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:12,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:42:12,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:12,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1026638627, now seen corresponding path program 1 times [2023-12-15 20:42:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492823232] [2023-12-15 20:42:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492823232] [2023-12-15 20:42:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492823232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:12,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726987198] [2023-12-15 20:42:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:12,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:12,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:12,801 INFO L87 Difference]: Start difference. First operand 55 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:12,835 INFO L93 Difference]: Finished difference Result 110 states and 173 transitions. [2023-12-15 20:42:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:12,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:42:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:12,836 INFO L225 Difference]: With dead ends: 110 [2023-12-15 20:42:12,836 INFO L226 Difference]: Without dead ends: 56 [2023-12-15 20:42:12,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-15 20:42:12,838 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:12,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-15 20:42:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-15 20:42:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.5) internal successors, (63), 42 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2023-12-15 20:42:12,846 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 85 [2023-12-15 20:42:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:12,847 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2023-12-15 20:42:12,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2023-12-15 20:42:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:42:12,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:12,849 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:12,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:42:12,849 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:12,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1835985253, now seen corresponding path program 1 times [2023-12-15 20:42:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:12,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203762323] [2023-12-15 20:42:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:12,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:13,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203762323] [2023-12-15 20:42:13,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203762323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:13,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:42:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754517177] [2023-12-15 20:42:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:13,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:42:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:42:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:13,027 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:13,200 INFO L93 Difference]: Finished difference Result 145 states and 225 transitions. [2023-12-15 20:42:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:42:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:42:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:13,205 INFO L225 Difference]: With dead ends: 145 [2023-12-15 20:42:13,205 INFO L226 Difference]: Without dead ends: 90 [2023-12-15 20:42:13,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-15 20:42:13,206 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:13,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 278 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-15 20:42:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 58. [2023-12-15 20:42:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2023-12-15 20:42:13,220 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 85 [2023-12-15 20:42:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:13,220 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2023-12-15 20:42:13,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2023-12-15 20:42:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:42:13,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:13,250 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:13,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:42:13,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:13,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1134920675, now seen corresponding path program 1 times [2023-12-15 20:42:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:13,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500678976] [2023-12-15 20:42:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500678976] [2023-12-15 20:42:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500678976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:42:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065487424] [2023-12-15 20:42:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:14,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:14,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:14,331 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:14,766 INFO L93 Difference]: Finished difference Result 180 states and 279 transitions. [2023-12-15 20:42:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:42:14,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:42:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:14,770 INFO L225 Difference]: With dead ends: 180 [2023-12-15 20:42:14,770 INFO L226 Difference]: Without dead ends: 123 [2023-12-15 20:42:14,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:42:14,771 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 120 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:14,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 332 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:42:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-15 20:42:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2023-12-15 20:42:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 65 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2023-12-15 20:42:14,779 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 85 [2023-12-15 20:42:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:14,779 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2023-12-15 20:42:14,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2023-12-15 20:42:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:42:14,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:14,788 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:14,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:42:14,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:14,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1571698719, now seen corresponding path program 1 times [2023-12-15 20:42:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355675016] [2023-12-15 20:42:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355675016] [2023-12-15 20:42:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355675016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:15,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:15,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:42:15,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405264010] [2023-12-15 20:42:15,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:15,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:15,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:15,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:15,148 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:15,410 INFO L93 Difference]: Finished difference Result 212 states and 329 transitions. [2023-12-15 20:42:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:42:15,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:42:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:15,413 INFO L225 Difference]: With dead ends: 212 [2023-12-15 20:42:15,413 INFO L226 Difference]: Without dead ends: 134 [2023-12-15 20:42:15,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:42:15,414 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 144 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:15,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 358 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-15 20:42:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 68. [2023-12-15 20:42:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5) internal successors, (81), 54 states have internal predecessors, (81), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2023-12-15 20:42:15,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 85 [2023-12-15 20:42:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:15,420 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2023-12-15 20:42:15,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2023-12-15 20:42:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-15 20:42:15,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:15,426 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:42:15,427 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:15,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 667005088, now seen corresponding path program 1 times [2023-12-15 20:42:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:15,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146091440] [2023-12-15 20:42:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146091440] [2023-12-15 20:42:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146091440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298985568] [2023-12-15 20:42:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:15,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:15,478 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:15,511 INFO L93 Difference]: Finished difference Result 179 states and 275 transitions. [2023-12-15 20:42:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-12-15 20:42:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:15,513 INFO L225 Difference]: With dead ends: 179 [2023-12-15 20:42:15,513 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 20:42:15,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-15 20:42:15,517 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:15,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 20:42:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2023-12-15 20:42:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2023-12-15 20:42:15,534 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 86 [2023-12-15 20:42:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:15,534 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2023-12-15 20:42:15,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2023-12-15 20:42:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-15 20:42:15,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:15,535 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:15,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:42:15,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:15,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -39689868, now seen corresponding path program 1 times [2023-12-15 20:42:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854836294] [2023-12-15 20:42:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:15,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854836294] [2023-12-15 20:42:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854836294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:15,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:15,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026647546] [2023-12-15 20:42:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:15,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:15,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:15,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:15,588 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:15,615 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2023-12-15 20:42:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-12-15 20:42:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:15,617 INFO L225 Difference]: With dead ends: 188 [2023-12-15 20:42:15,618 INFO L226 Difference]: Without dead ends: 110 [2023-12-15 20:42:15,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-15 20:42:15,621 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 71 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:15,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 142 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-15 20:42:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 69. [2023-12-15 20:42:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:42:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2023-12-15 20:42:15,636 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 86 [2023-12-15 20:42:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:15,636 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2023-12-15 20:42:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2023-12-15 20:42:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-15 20:42:15,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:15,638 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:42:15,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:15,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 259421737, now seen corresponding path program 1 times [2023-12-15 20:42:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373394111] [2023-12-15 20:42:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373394111] [2023-12-15 20:42:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373394111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:15,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:15,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:42:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846955934] [2023-12-15 20:42:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:42:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:42:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:15,731 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:15,915 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2023-12-15 20:42:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:42:15,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-15 20:42:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:15,916 INFO L225 Difference]: With dead ends: 224 [2023-12-15 20:42:15,916 INFO L226 Difference]: Without dead ends: 156 [2023-12-15 20:42:15,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:15,918 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 209 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:15,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 329 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-15 20:42:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2023-12-15 20:42:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 114 states have internal predecessors, (157), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 20:42:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2023-12-15 20:42:15,944 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 87 [2023-12-15 20:42:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:15,945 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2023-12-15 20:42:15,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2023-12-15 20:42:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-15 20:42:15,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:15,946 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:15,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:42:15,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:15,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 517587175, now seen corresponding path program 1 times [2023-12-15 20:42:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:15,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146272759] [2023-12-15 20:42:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:16,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146272759] [2023-12-15 20:42:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146272759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:16,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:42:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765312801] [2023-12-15 20:42:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:16,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:42:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:16,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:42:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:16,829 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:17,597 INFO L93 Difference]: Finished difference Result 415 states and 609 transitions. [2023-12-15 20:42:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:42:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-15 20:42:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:17,600 INFO L225 Difference]: With dead ends: 415 [2023-12-15 20:42:17,600 INFO L226 Difference]: Without dead ends: 276 [2023-12-15 20:42:17,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:42:17,601 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 279 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:17,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 355 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 20:42:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-12-15 20:42:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 161. [2023-12-15 20:42:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 132 states have internal predecessors, (184), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 20:42:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2023-12-15 20:42:17,610 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 87 [2023-12-15 20:42:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:17,611 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2023-12-15 20:42:17,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2023-12-15 20:42:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-15 20:42:17,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:17,612 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:17,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:42:17,612 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:17,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1171356567, now seen corresponding path program 1 times [2023-12-15 20:42:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:17,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280856792] [2023-12-15 20:42:17,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:17,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280856792] [2023-12-15 20:42:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280856792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721553496] [2023-12-15 20:42:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:17,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:17,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:17,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:17,701 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:17,752 INFO L93 Difference]: Finished difference Result 455 states and 667 transitions. [2023-12-15 20:42:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-15 20:42:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:17,755 INFO L225 Difference]: With dead ends: 455 [2023-12-15 20:42:17,755 INFO L226 Difference]: Without dead ends: 298 [2023-12-15 20:42:17,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-15 20:42:17,755 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 57 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:17,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-15 20:42:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 234. [2023-12-15 20:42:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 191 states have internal predecessors, (264), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-15 20:42:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2023-12-15 20:42:17,769 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 87 [2023-12-15 20:42:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:17,769 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2023-12-15 20:42:17,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2023-12-15 20:42:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:17,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:17,770 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:17,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:42:17,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:17,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 835858693, now seen corresponding path program 1 times [2023-12-15 20:42:17,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:17,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608095913] [2023-12-15 20:42:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608095913] [2023-12-15 20:42:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608095913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:42:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238608587] [2023-12-15 20:42:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:18,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:42:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:18,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:42:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:42:18,094 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:18,364 INFO L93 Difference]: Finished difference Result 524 states and 748 transitions. [2023-12-15 20:42:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:42:18,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:18,366 INFO L225 Difference]: With dead ends: 524 [2023-12-15 20:42:18,366 INFO L226 Difference]: Without dead ends: 294 [2023-12-15 20:42:18,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:42:18,367 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 149 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:18,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 244 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-15 20:42:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 242. [2023-12-15 20:42:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 200 states have (on average 1.28) internal successors, (256), 201 states have internal predecessors, (256), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 20:42:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2023-12-15 20:42:18,399 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 88 [2023-12-15 20:42:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:18,399 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2023-12-15 20:42:18,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2023-12-15 20:42:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:18,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:18,400 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:18,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 20:42:18,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:18,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash 498286641, now seen corresponding path program 1 times [2023-12-15 20:42:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768876023] [2023-12-15 20:42:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768876023] [2023-12-15 20:42:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768876023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732156125] [2023-12-15 20:42:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:18,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:18,436 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:18,500 INFO L93 Difference]: Finished difference Result 457 states and 617 transitions. [2023-12-15 20:42:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:18,503 INFO L225 Difference]: With dead ends: 457 [2023-12-15 20:42:18,503 INFO L226 Difference]: Without dead ends: 337 [2023-12-15 20:42:18,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-15 20:42:18,504 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 64 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:18,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 178 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-12-15 20:42:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2023-12-15 20:42:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 279 states have (on average 1.2616487455197132) internal successors, (352), 280 states have internal predecessors, (352), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 20:42:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2023-12-15 20:42:18,529 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 88 [2023-12-15 20:42:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:18,529 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2023-12-15 20:42:18,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2023-12-15 20:42:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:18,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:18,530 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:18,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 20:42:18,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:18,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:18,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1689607901, now seen corresponding path program 1 times [2023-12-15 20:42:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:18,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841333770] [2023-12-15 20:42:18,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:18,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:18,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841333770] [2023-12-15 20:42:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841333770] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:18,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:18,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963683157] [2023-12-15 20:42:18,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:18,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:18,569 INFO L87 Difference]: Start difference. First operand 335 states and 448 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:18,614 INFO L93 Difference]: Finished difference Result 616 states and 816 transitions. [2023-12-15 20:42:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:18,616 INFO L225 Difference]: With dead ends: 616 [2023-12-15 20:42:18,616 INFO L226 Difference]: Without dead ends: 403 [2023-12-15 20:42:18,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-15 20:42:18,617 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:18,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 149 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-15 20:42:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2023-12-15 20:42:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-15 20:42:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 528 transitions. [2023-12-15 20:42:18,641 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 528 transitions. Word has length 88 [2023-12-15 20:42:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:18,643 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 528 transitions. [2023-12-15 20:42:18,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 528 transitions. [2023-12-15 20:42:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:18,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:18,644 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:18,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 20:42:18,644 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:18,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 414863964, now seen corresponding path program 1 times [2023-12-15 20:42:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924092257] [2023-12-15 20:42:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924092257] [2023-12-15 20:42:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924092257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:42:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931251695] [2023-12-15 20:42:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:18,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:42:18,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:42:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:18,747 INFO L87 Difference]: Start difference. First operand 401 states and 528 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:19,006 INFO L93 Difference]: Finished difference Result 944 states and 1245 transitions. [2023-12-15 20:42:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:42:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:19,009 INFO L225 Difference]: With dead ends: 944 [2023-12-15 20:42:19,009 INFO L226 Difference]: Without dead ends: 665 [2023-12-15 20:42:19,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:42:19,010 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 150 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:19,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 428 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-15 20:42:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 409. [2023-12-15 20:42:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 339 states have (on average 1.2359882005899705) internal successors, (419), 340 states have internal predecessors, (419), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-15 20:42:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 539 transitions. [2023-12-15 20:42:19,031 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 539 transitions. Word has length 88 [2023-12-15 20:42:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:19,032 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 539 transitions. [2023-12-15 20:42:19,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 539 transitions. [2023-12-15 20:42:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:19,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:19,033 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:19,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 20:42:19,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:19,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 673029402, now seen corresponding path program 1 times [2023-12-15 20:42:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:19,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111396050] [2023-12-15 20:42:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111396050] [2023-12-15 20:42:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111396050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:19,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392607985] [2023-12-15 20:42:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:19,085 INFO L87 Difference]: Start difference. First operand 409 states and 539 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:19,142 INFO L93 Difference]: Finished difference Result 688 states and 902 transitions. [2023-12-15 20:42:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:19,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:19,144 INFO L225 Difference]: With dead ends: 688 [2023-12-15 20:42:19,144 INFO L226 Difference]: Without dead ends: 401 [2023-12-15 20:42:19,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-15 20:42:19,146 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:19,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-12-15 20:42:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 302. [2023-12-15 20:42:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 246 states have (on average 1.2113821138211383) internal successors, (298), 247 states have internal predecessors, (298), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 20:42:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 394 transitions. [2023-12-15 20:42:19,164 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 394 transitions. Word has length 88 [2023-12-15 20:42:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:19,164 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 394 transitions. [2023-12-15 20:42:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 394 transitions. [2023-12-15 20:42:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:19,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:19,165 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:19,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 20:42:19,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:19,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1173483938, now seen corresponding path program 1 times [2023-12-15 20:42:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:19,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139815011] [2023-12-15 20:42:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139815011] [2023-12-15 20:42:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139815011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:42:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103766078] [2023-12-15 20:42:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:42:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:42:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:19,221 INFO L87 Difference]: Start difference. First operand 302 states and 394 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:19,344 INFO L93 Difference]: Finished difference Result 601 states and 783 transitions. [2023-12-15 20:42:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:42:19,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:19,346 INFO L225 Difference]: With dead ends: 601 [2023-12-15 20:42:19,346 INFO L226 Difference]: Without dead ends: 322 [2023-12-15 20:42:19,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:19,347 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:19,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 302 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-15 20:42:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 306. [2023-12-15 20:42:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 250 states have (on average 1.204) internal successors, (301), 251 states have internal predecessors, (301), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 20:42:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 397 transitions. [2023-12-15 20:42:19,362 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 397 transitions. Word has length 88 [2023-12-15 20:42:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:19,363 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 397 transitions. [2023-12-15 20:42:19,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2023-12-15 20:42:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:42:19,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:19,364 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:19,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 20:42:19,364 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:19,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -915318500, now seen corresponding path program 1 times [2023-12-15 20:42:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401405624] [2023-12-15 20:42:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401405624] [2023-12-15 20:42:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401405624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:42:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822961235] [2023-12-15 20:42:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:19,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:42:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:42:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:19,435 INFO L87 Difference]: Start difference. First operand 306 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:19,667 INFO L93 Difference]: Finished difference Result 717 states and 930 transitions. [2023-12-15 20:42:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:42:19,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:42:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:19,669 INFO L225 Difference]: With dead ends: 717 [2023-12-15 20:42:19,669 INFO L226 Difference]: Without dead ends: 433 [2023-12-15 20:42:19,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:19,670 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 201 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:19,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 242 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-15 20:42:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 290. [2023-12-15 20:42:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 234 states have (on average 1.188034188034188) internal successors, (278), 235 states have internal predecessors, (278), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 20:42:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 374 transitions. [2023-12-15 20:42:19,689 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 374 transitions. Word has length 88 [2023-12-15 20:42:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:19,689 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 374 transitions. [2023-12-15 20:42:19,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 374 transitions. [2023-12-15 20:42:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-15 20:42:19,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:19,690 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:19,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 20:42:19,690 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:19,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1884384765, now seen corresponding path program 1 times [2023-12-15 20:42:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550674017] [2023-12-15 20:42:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550674017] [2023-12-15 20:42:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550674017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:19,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:19,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:42:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879263097] [2023-12-15 20:42:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:19,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:42:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:42:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:19,793 INFO L87 Difference]: Start difference. First operand 290 states and 374 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:20,064 INFO L93 Difference]: Finished difference Result 641 states and 824 transitions. [2023-12-15 20:42:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:42:20,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-12-15 20:42:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:20,065 INFO L225 Difference]: With dead ends: 641 [2023-12-15 20:42:20,065 INFO L226 Difference]: Without dead ends: 374 [2023-12-15 20:42:20,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-15 20:42:20,066 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 195 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:20,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 354 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-15 20:42:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2023-12-15 20:42:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 258 states have (on average 1.1744186046511629) internal successors, (303), 259 states have internal predecessors, (303), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-15 20:42:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2023-12-15 20:42:20,090 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 89 [2023-12-15 20:42:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:20,091 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2023-12-15 20:42:20,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2023-12-15 20:42:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-15 20:42:20,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:20,091 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:20,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 20:42:20,092 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:20,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -634544272, now seen corresponding path program 1 times [2023-12-15 20:42:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775997646] [2023-12-15 20:42:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775997646] [2023-12-15 20:42:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775997646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:20,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:42:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198101942] [2023-12-15 20:42:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:20,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:42:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:42:20,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:20,447 INFO L87 Difference]: Start difference. First operand 328 states and 423 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:20,859 INFO L93 Difference]: Finished difference Result 762 states and 972 transitions. [2023-12-15 20:42:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:42:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-12-15 20:42:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:20,861 INFO L225 Difference]: With dead ends: 762 [2023-12-15 20:42:20,861 INFO L226 Difference]: Without dead ends: 457 [2023-12-15 20:42:20,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:42:20,862 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:20,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 345 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:42:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-15 20:42:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 447. [2023-12-15 20:42:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 325 states have (on average 1.1292307692307693) internal successors, (367), 330 states have internal predecessors, (367), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-15 20:42:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 567 transitions. [2023-12-15 20:42:20,907 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 567 transitions. Word has length 89 [2023-12-15 20:42:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:20,907 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 567 transitions. [2023-12-15 20:42:20,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 567 transitions. [2023-12-15 20:42:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:42:20,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:20,908 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:20,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 20:42:20,908 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:20,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash -958965774, now seen corresponding path program 1 times [2023-12-15 20:42:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:20,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126875499] [2023-12-15 20:42:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:20,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:20,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126875499] [2023-12-15 20:42:20,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126875499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:42:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187738945] [2023-12-15 20:42:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:20,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:42:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:42:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:42:20,970 INFO L87 Difference]: Start difference. First operand 447 states and 567 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:21,209 INFO L93 Difference]: Finished difference Result 1082 states and 1367 transitions. [2023-12-15 20:42:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:42:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-15 20:42:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:21,211 INFO L225 Difference]: With dead ends: 1082 [2023-12-15 20:42:21,211 INFO L226 Difference]: Without dead ends: 658 [2023-12-15 20:42:21,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-15 20:42:21,214 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 153 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:21,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 142 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2023-12-15 20:42:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 436. [2023-12-15 20:42:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 327 states have (on average 1.1376146788990826) internal successors, (372), 331 states have internal predecessors, (372), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 548 transitions. [2023-12-15 20:42:21,282 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 548 transitions. Word has length 90 [2023-12-15 20:42:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:21,282 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 548 transitions. [2023-12-15 20:42:21,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 548 transitions. [2023-12-15 20:42:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:42:21,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:21,283 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:21,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 20:42:21,283 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:21,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash -911658576, now seen corresponding path program 1 times [2023-12-15 20:42:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471789264] [2023-12-15 20:42:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471789264] [2023-12-15 20:42:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471789264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:21,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:21,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:42:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479762553] [2023-12-15 20:42:21,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:21,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:42:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:42:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:21,356 INFO L87 Difference]: Start difference. First operand 436 states and 548 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:21,503 INFO L93 Difference]: Finished difference Result 905 states and 1142 transitions. [2023-12-15 20:42:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:42:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-15 20:42:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:21,505 INFO L225 Difference]: With dead ends: 905 [2023-12-15 20:42:21,505 INFO L226 Difference]: Without dead ends: 470 [2023-12-15 20:42:21,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:42:21,506 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:21,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 235 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-12-15 20:42:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2023-12-15 20:42:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 325 states have (on average 1.1323076923076922) internal successors, (368), 329 states have internal predecessors, (368), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 544 transitions. [2023-12-15 20:42:21,555 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 544 transitions. Word has length 90 [2023-12-15 20:42:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:21,555 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 544 transitions. [2023-12-15 20:42:21,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 544 transitions. [2023-12-15 20:42:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:42:21,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:21,557 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:21,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 20:42:21,557 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:21,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1922775826, now seen corresponding path program 1 times [2023-12-15 20:42:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640508471] [2023-12-15 20:42:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:21,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640508471] [2023-12-15 20:42:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640508471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:21,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:21,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:42:21,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901812420] [2023-12-15 20:42:21,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:21,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:42:21,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:21,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:42:21,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:21,628 INFO L87 Difference]: Start difference. First operand 434 states and 544 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:21,799 INFO L93 Difference]: Finished difference Result 896 states and 1127 transitions. [2023-12-15 20:42:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:42:21,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-15 20:42:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:21,801 INFO L225 Difference]: With dead ends: 896 [2023-12-15 20:42:21,801 INFO L226 Difference]: Without dead ends: 463 [2023-12-15 20:42:21,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-15 20:42:21,803 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 70 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:21,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 235 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-15 20:42:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 432. [2023-12-15 20:42:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 323 states have (on average 1.1176470588235294) internal successors, (361), 327 states have internal predecessors, (361), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 537 transitions. [2023-12-15 20:42:21,854 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 537 transitions. Word has length 90 [2023-12-15 20:42:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:21,855 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 537 transitions. [2023-12-15 20:42:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 537 transitions. [2023-12-15 20:42:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:42:21,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:21,856 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:21,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 20:42:21,856 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:21,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1979164460, now seen corresponding path program 1 times [2023-12-15 20:42:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564221469] [2023-12-15 20:42:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:22,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564221469] [2023-12-15 20:42:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564221469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:22,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:22,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:42:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432576206] [2023-12-15 20:42:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:22,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:42:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:22,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:42:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:42:22,329 INFO L87 Difference]: Start difference. First operand 432 states and 537 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:22,514 INFO L93 Difference]: Finished difference Result 862 states and 1071 transitions. [2023-12-15 20:42:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:42:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-15 20:42:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:22,516 INFO L225 Difference]: With dead ends: 862 [2023-12-15 20:42:22,516 INFO L226 Difference]: Without dead ends: 431 [2023-12-15 20:42:22,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:42:22,517 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:22,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 178 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-12-15 20:42:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2023-12-15 20:42:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 310 states have (on average 1.103225806451613) internal successors, (342), 314 states have internal predecessors, (342), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 518 transitions. [2023-12-15 20:42:22,566 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 518 transitions. Word has length 90 [2023-12-15 20:42:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:22,566 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 518 transitions. [2023-12-15 20:42:22,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 518 transitions. [2023-12-15 20:42:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 20:42:22,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:22,567 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:22,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 20:42:22,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:22,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -538538961, now seen corresponding path program 1 times [2023-12-15 20:42:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454667224] [2023-12-15 20:42:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:22,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454667224] [2023-12-15 20:42:22,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454667224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:22,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:22,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:42:22,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742431381] [2023-12-15 20:42:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:22,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:22,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:22,678 INFO L87 Difference]: Start difference. First operand 419 states and 518 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:23,038 INFO L93 Difference]: Finished difference Result 908 states and 1129 transitions. [2023-12-15 20:42:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:42:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2023-12-15 20:42:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:23,054 INFO L225 Difference]: With dead ends: 908 [2023-12-15 20:42:23,054 INFO L226 Difference]: Without dead ends: 490 [2023-12-15 20:42:23,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:42:23,055 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 223 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:23,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 307 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-15 20:42:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 419. [2023-12-15 20:42:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 310 states have (on average 1.1) internal successors, (341), 314 states have internal predecessors, (341), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 517 transitions. [2023-12-15 20:42:23,106 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 517 transitions. Word has length 91 [2023-12-15 20:42:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:23,106 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 517 transitions. [2023-12-15 20:42:23,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 517 transitions. [2023-12-15 20:42:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 20:42:23,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:23,107 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:23,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 20:42:23,107 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:23,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash -536691919, now seen corresponding path program 1 times [2023-12-15 20:42:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330328863] [2023-12-15 20:42:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330328863] [2023-12-15 20:42:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330328863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:23,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:23,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:42:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124144113] [2023-12-15 20:42:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:23,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:42:23,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:23,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:42:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:23,168 INFO L87 Difference]: Start difference. First operand 419 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:23,301 INFO L93 Difference]: Finished difference Result 896 states and 1113 transitions. [2023-12-15 20:42:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:42:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2023-12-15 20:42:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:23,304 INFO L225 Difference]: With dead ends: 896 [2023-12-15 20:42:23,304 INFO L226 Difference]: Without dead ends: 478 [2023-12-15 20:42:23,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:23,305 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:23,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 326 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-15 20:42:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 411. [2023-12-15 20:42:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 302 states have (on average 1.096026490066225) internal successors, (331), 306 states have internal predecessors, (331), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 507 transitions. [2023-12-15 20:42:23,386 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 507 transitions. Word has length 91 [2023-12-15 20:42:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:23,386 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 507 transitions. [2023-12-15 20:42:23,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 507 transitions. [2023-12-15 20:42:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 20:42:23,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:23,388 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:23,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 20:42:23,388 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:23,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 225298420, now seen corresponding path program 1 times [2023-12-15 20:42:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021245669] [2023-12-15 20:42:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021245669] [2023-12-15 20:42:23,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021245669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:23,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:23,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:42:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513720338] [2023-12-15 20:42:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:23,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:42:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:42:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:23,505 INFO L87 Difference]: Start difference. First operand 411 states and 507 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:23,869 INFO L93 Difference]: Finished difference Result 1017 states and 1253 transitions. [2023-12-15 20:42:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:42:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2023-12-15 20:42:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:23,872 INFO L225 Difference]: With dead ends: 1017 [2023-12-15 20:42:23,872 INFO L226 Difference]: Without dead ends: 607 [2023-12-15 20:42:23,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:23,873 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 198 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:23,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 291 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-15 20:42:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 416. [2023-12-15 20:42:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 307 states have (on average 1.0977198697068404) internal successors, (337), 311 states have internal predecessors, (337), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 20:42:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 513 transitions. [2023-12-15 20:42:23,930 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 513 transitions. Word has length 94 [2023-12-15 20:42:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:23,931 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 513 transitions. [2023-12-15 20:42:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 513 transitions. [2023-12-15 20:42:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 20:42:23,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:23,931 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:42:23,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 20:42:23,932 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:23,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 227145462, now seen corresponding path program 1 times [2023-12-15 20:42:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159124470] [2023-12-15 20:42:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:42:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159124470] [2023-12-15 20:42:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159124470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:24,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:24,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:42:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548838799] [2023-12-15 20:42:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:24,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:42:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:24,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:42:24,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:24,306 INFO L87 Difference]: Start difference. First operand 416 states and 513 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:24,615 INFO L93 Difference]: Finished difference Result 445 states and 553 transitions. [2023-12-15 20:42:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:42:24,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2023-12-15 20:42:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:24,616 INFO L225 Difference]: With dead ends: 445 [2023-12-15 20:42:24,616 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:42:24,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-15 20:42:24,617 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 114 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:24,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:42:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:42:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 20:42:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:42:24,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2023-12-15 20:42:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:24,619 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:42:24,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:42:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:42:24,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:42:24,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:42:24,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 20:42:24,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:42:56,168 WARN L293 SmtUtils]: Spent 15.18s on a formula simplification. DAG size of input: 238 DAG size of output: 304 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-15 20:43:04,382 INFO L895 garLoopResultBuilder]: At program point L93-2(lines 93 99) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse6 (+ ~var_1_8~0 1)) (.cse0 (* .cse3 256))) (let ((.cse9 (+ ~var_1_8~0 .cse0 1)) (.cse10 (+ (* 256 (div .cse6 256)) ~var_1_7~0)) (.cse8 (+ ~var_1_5~0 1))) (let ((.cse2 (= (+ .cse0 ~var_1_16~0) ~var_1_7~0)) (.cse1 (or (= .cse9 .cse10) (< ~last_1_var_1_13~0 .cse8))) (.cse5 (* (div ~var_1_8~0 256) 256))) (or (and (not (= ~var_1_7~0 .cse0)) .cse1 (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2) (and (= (+ (* ~var_1_7~0 65534) 128) (+ (* .cse3 16776704) ~var_1_1~0 (* 65536 (div (+ 64 (* (- 8388352) .cse3) (* ~var_1_7~0 32767)) 32768)))) .cse1 (let ((.cse4 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse4) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse5 ~var_1_13~0)) .cse4))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (let ((.cse7 (< .cse9 .cse10))) (and (<= .cse6 (+ .cse5 ~var_1_7~0)) (or .cse7 (<= .cse8 ~last_1_var_1_13~0)) .cse1 (or (< ~var_1_8~0 (+ .cse5 ~var_1_16~0 ~var_1_13~0 1)) .cse7) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))))))) [2023-12-15 20:43:04,382 INFO L899 garLoopResultBuilder]: For program point L93-3(lines 93 99) no Hoare annotation was computed. [2023-12-15 20:43:04,382 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,383 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L53-4(line 53) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L53-6(line 53) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 62) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L87-2(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,383 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 37 62) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-4(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-6(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-7(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-8(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-10(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 43 51) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-12(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-14(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-16(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L87-18(line 87) no Hoare annotation was computed. [2023-12-15 20:43:04,384 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-12-15 20:43:04,385 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,385 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,385 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-15 20:43:04,385 INFO L899 garLoopResultBuilder]: For program point L81(lines 63 82) no Hoare annotation was computed. [2023-12-15 20:43:04,385 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse4 (* .cse3 256))) (let ((.cse1 (* (div ~var_1_8~0 256) 256)) (.cse2 (= (+ .cse4 ~var_1_16~0) ~var_1_7~0))) (or (and (let ((.cse0 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse0) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse1 ~var_1_13~0)) .cse0))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (and (<= (+ ~var_1_8~0 1) (+ .cse1 ~var_1_7~0)) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)) (and (not (= ~var_1_7~0 .cse4)) (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2))))) [2023-12-15 20:43:04,385 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse4 (* .cse3 256))) (let ((.cse1 (* (div ~var_1_8~0 256) 256)) (.cse2 (= (+ .cse4 ~var_1_16~0) ~var_1_7~0))) (or (and (let ((.cse0 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse0) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse1 ~var_1_13~0)) .cse0))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (and (<= (+ ~var_1_8~0 1) (+ .cse1 ~var_1_7~0)) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)) (and (not (= ~var_1_7~0 .cse4)) (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2))))) [2023-12-15 20:43:04,385 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:43:04,385 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,386 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L59-3(line 59) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L59-5(line 59) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L59-7(lines 59 61) no Hoare annotation was computed. [2023-12-15 20:43:04,386 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-12-15 20:43:04,387 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,387 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-15 20:43:04,387 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:43:04,387 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:43:04,387 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:43:04,387 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:43:04,390 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, 1, 1] [2023-12-15 20:43:04,392 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:43:04,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:43:04 BoogieIcfgContainer [2023-12-15 20:43:04,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:43:04,416 INFO L158 Benchmark]: Toolchain (without parser) took 53005.10ms. Allocated memory was 182.5MB in the beginning and 836.8MB in the end (delta: 654.3MB). Free memory was 134.3MB in the beginning and 598.2MB in the end (delta: -463.9MB). Peak memory consumption was 486.3MB. Max. memory is 8.0GB. [2023-12-15 20:43:04,416 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:43:04,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.00ms. Allocated memory is still 182.5MB. Free memory was 134.0MB in the beginning and 121.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:43:04,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 182.5MB. Free memory was 121.4MB in the beginning and 118.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:43:04,416 INFO L158 Benchmark]: Boogie Preprocessor took 39.26ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 114.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:43:04,416 INFO L158 Benchmark]: RCFGBuilder took 413.20ms. Allocated memory is still 182.5MB. Free memory was 114.8MB in the beginning and 150.7MB in the end (delta: -35.9MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2023-12-15 20:43:04,417 INFO L158 Benchmark]: TraceAbstraction took 52267.31ms. Allocated memory was 182.5MB in the beginning and 836.8MB in the end (delta: 654.3MB). Free memory was 150.1MB in the beginning and 598.2MB in the end (delta: -448.0MB). Peak memory consumption was 500.9MB. Max. memory is 8.0GB. [2023-12-15 20:43:04,417 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.10ms. Allocated memory is still 182.5MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.00ms. Allocated memory is still 182.5MB. Free memory was 134.0MB in the beginning and 121.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 182.5MB. Free memory was 121.4MB in the beginning and 118.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.26ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 114.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 413.20ms. Allocated memory is still 182.5MB. Free memory was 114.8MB in the beginning and 150.7MB in the end (delta: -35.9MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. * TraceAbstraction took 52267.31ms. Allocated memory was 182.5MB in the beginning and 836.8MB in the end (delta: 654.3MB). Free memory was 150.1MB in the beginning and 598.2MB in the end (delta: -448.0MB). Peak memory consumption was 500.9MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.2s, OverallIterations: 27, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3235 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3235 mSDsluCounter, 6688 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4104 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4312 IncrementalHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 2584 mSDtfsCounter, 4312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=19, InterpolantAutomatonStates: 166, 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, 27 MinimizatonAttempts, 1664 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 1173 PreInvPairs, 1282 NumberOfFragments, 730 HoareAnnotationTreeSize, 1173 FormulaSimplifications, 2650636 FormulaSimplificationTreeSizeReduction, 35.2s HoareSimplificationTime, 14 FormulaSimplificationsInter, 272468 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2382 NumberOfCodeBlocks, 2382 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2355 ConstructedInterpolants, 0 QuantifiedInterpolants, 11819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 7128/7128 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((!((var_1_7 == ((var_1_7 / 256) * 256))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && (0 <= (var_1_16 + var_1_13))) && ((((var_1_7 / 256) * 256) + var_1_16) == var_1_7)) || (((((((var_1_7 * 65534) + 128) == ((((var_1_7 / 256) * 16776704) + var_1_1) + (65536 * (((64 + (-8388352 * (var_1_7 / 256))) + (var_1_7 * 32767)) / 32768)))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && ((!(((256 * (var_1_14 / 256)) == var_1_14)) && (var_1_16 == var_1_13)) || ((var_1_8 == (((var_1_8 / 256) * 256) + var_1_13)) && ((256 * (var_1_14 / 256)) == var_1_14)))) && (var_1_15 == var_1_11)) && ((((var_1_7 / 256) * 256) + var_1_16) == var_1_7))) || ((((((((var_1_8 + 1) <= (((var_1_8 / 256) * 256) + var_1_7)) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) < ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || ((var_1_5 + 1) <= last_1_var_1_13))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && ((var_1_8 < (((((var_1_8 / 256) * 256) + var_1_16) + var_1_13) + 1)) || (((var_1_8 + ((var_1_7 / 256) * 256)) + 1) < ((256 * ((var_1_8 + 1) / 256)) + var_1_7)))) && (200 <= var_1_7)) && ((var_1_7 / 256) <= 0)) && ((var_1_13 + 1) <= var_1_7))) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:43:04,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...