./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4bbaaa17258129f6bb60f5a0d551610bd9b55c16f80d3fd4e62d867a6759bbe --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:17,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:17,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:13:17,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:17,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:17,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:17,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:17,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:17,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:17,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:17,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:17,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:17,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:17,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:17,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:17,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:17,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:17,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:17,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:13:17,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:17,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:17,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:17,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:17,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:17,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:17,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:17,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:17,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:17,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:17,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:17,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:17,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:17,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:17,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:17,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:17,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:17,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:13:17,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:13:17,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:17,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:17,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:17,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:17,627 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4bbaaa17258129f6bb60f5a0d551610bd9b55c16f80d3fd4e62d867a6759bbe [2024-11-09 02:13:17,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:17,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:17,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:17,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:17,921 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:17,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i [2024-11-09 02:13:19,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:19,607 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:19,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i [2024-11-09 02:13:19,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ceac062/e130c79105d0407888b775c36670f7c5/FLAG791485a82 [2024-11-09 02:13:19,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ceac062/e130c79105d0407888b775c36670f7c5 [2024-11-09 02:13:19,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:19,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:19,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:19,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:19,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:19,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:19" (1/1) ... [2024-11-09 02:13:19,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784409fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:19, skipping insertion in model container [2024-11-09 02:13:19,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:19" (1/1) ... [2024-11-09 02:13:20,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:20,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i[917,930] [2024-11-09 02:13:20,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:20,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:20,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i[917,930] [2024-11-09 02:13:20,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:20,408 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:20,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20 WrapperNode [2024-11-09 02:13:20,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:20,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:20,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:20,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:20,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,477 INFO L138 Inliner]: procedures = 30, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-09 02:13:20,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:20,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:20,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:20,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:20,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,511 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:13:20,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:20,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:20,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:20,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:20,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (1/1) ... [2024-11-09 02:13:20,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:20,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:20,607 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) [2024-11-09 02:13:20,613 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 [2024-11-09 02:13:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:13:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:13:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:13:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:13:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:13:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:13:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:13:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:20,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:20,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:13:21,529 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-09 02:13:21,529 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:13:21,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:13:21,550 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:13:21,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:21 BoogieIcfgContainer [2024-11-09 02:13:21,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:13:21,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:13:21,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:13:21,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:13:21,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:19" (1/3) ... [2024-11-09 02:13:21,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6bd347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:21, skipping insertion in model container [2024-11-09 02:13:21,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:20" (2/3) ... [2024-11-09 02:13:21,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6bd347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:21, skipping insertion in model container [2024-11-09 02:13:21,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:21" (3/3) ... [2024-11-09 02:13:21,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-44.i [2024-11-09 02:13:21,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:13:21,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:13:21,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:13:21,661 INFO L333 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, 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;@405ea62d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:13:21,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:13:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:13:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 02:13:21,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:21,688 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:21,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1924656963, now seen corresponding path program 1 times [2024-11-09 02:13:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:21,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373367969] [2024-11-09 02:13:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373367969] [2024-11-09 02:13:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373367969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:22,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:13:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006507264] [2024-11-09 02:13:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:22,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:13:22,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:13:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:22,324 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:22,363 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-09 02:13:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:13:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-09 02:13:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:22,376 INFO L225 Difference]: With dead ends: 229 [2024-11-09 02:13:22,377 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 02:13:22,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:22,385 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:22,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 02:13:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 02:13:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:13:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-09 02:13:22,440 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-09 02:13:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:22,441 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-09 02:13:22,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-09 02:13:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 02:13:22,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:22,448 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:13:22,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash -781629009, now seen corresponding path program 1 times [2024-11-09 02:13:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928949532] [2024-11-09 02:13:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928949532] [2024-11-09 02:13:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928949532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:13:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111264071] [2024-11-09 02:13:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:22,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:13:22,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:13:22,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:22,971 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:23,026 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2024-11-09 02:13:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-09 02:13:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:23,030 INFO L225 Difference]: With dead ends: 227 [2024-11-09 02:13:23,031 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:13:23,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:23,035 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:23,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:13:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 02:13:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:13:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-09 02:13:23,054 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 159 [2024-11-09 02:13:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:23,056 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-09 02:13:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-09 02:13:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 02:13:23,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:23,063 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:23,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:13:23,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1483228883, now seen corresponding path program 1 times [2024-11-09 02:13:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185021483] [2024-11-09 02:13:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185021483] [2024-11-09 02:13:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185021483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:13:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493751975] [2024-11-09 02:13:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:23,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:13:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:13:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:23,377 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:23,427 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2024-11-09 02:13:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-09 02:13:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:23,433 INFO L225 Difference]: With dead ends: 232 [2024-11-09 02:13:23,433 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 02:13:23,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:23,436 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:23,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 477 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 02:13:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 02:13:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:13:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2024-11-09 02:13:23,453 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 159 [2024-11-09 02:13:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2024-11-09 02:13:23,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2024-11-09 02:13:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 02:13:23,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:23,458 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:23,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:13:23,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:23,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1481381841, now seen corresponding path program 1 times [2024-11-09 02:13:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313800761] [2024-11-09 02:13:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313800761] [2024-11-09 02:13:24,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313800761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:24,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:24,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:13:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718039385] [2024-11-09 02:13:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:24,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:13:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:13:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:13:24,660 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:25,555 INFO L93 Difference]: Finished difference Result 287 states and 412 transitions. [2024-11-09 02:13:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:13:25,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-09 02:13:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:25,558 INFO L225 Difference]: With dead ends: 287 [2024-11-09 02:13:25,558 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 02:13:25,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:13:25,563 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 180 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:25,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 607 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:13:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 02:13:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 130. [2024-11-09 02:13:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:13:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2024-11-09 02:13:25,587 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 159 [2024-11-09 02:13:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:25,588 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2024-11-09 02:13:25,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-11-09 02:13:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 02:13:25,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:25,590 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:13:25,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1187624250, now seen corresponding path program 1 times [2024-11-09 02:13:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695963590] [2024-11-09 02:13:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695963590] [2024-11-09 02:13:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695963590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:25,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:25,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:13:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329357347] [2024-11-09 02:13:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:25,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:13:25,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:13:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:25,819 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:25,985 INFO L93 Difference]: Finished difference Result 259 states and 373 transitions. [2024-11-09 02:13:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:25,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-11-09 02:13:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:25,988 INFO L225 Difference]: With dead ends: 259 [2024-11-09 02:13:25,988 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 02:13:25,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:25,989 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:25,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 428 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:13:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 02:13:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-11-09 02:13:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:13:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2024-11-09 02:13:26,002 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 160 [2024-11-09 02:13:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:26,023 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2024-11-09 02:13:26,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2024-11-09 02:13:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 02:13:26,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:26,025 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:13:26,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:26,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash -390938977, now seen corresponding path program 1 times [2024-11-09 02:13:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009459049] [2024-11-09 02:13:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009459049] [2024-11-09 02:13:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009459049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:28,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:28,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:13:28,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747675429] [2024-11-09 02:13:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:28,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:13:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:13:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:13:28,629 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:29,173 INFO L93 Difference]: Finished difference Result 384 states and 549 transitions. [2024-11-09 02:13:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 160 [2024-11-09 02:13:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:29,176 INFO L225 Difference]: With dead ends: 384 [2024-11-09 02:13:29,176 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 02:13:29,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:13:29,180 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 110 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:29,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 777 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:13:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 02:13:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2024-11-09 02:13:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.3284313725490196) internal successors, (271), 204 states have internal predecessors, (271), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:13:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 355 transitions. [2024-11-09 02:13:29,218 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 355 transitions. Word has length 160 [2024-11-09 02:13:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:29,218 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 355 transitions. [2024-11-09 02:13:29,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 355 transitions. [2024-11-09 02:13:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 02:13:29,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:29,220 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:29,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:13:29,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1861974629, now seen corresponding path program 1 times [2024-11-09 02:13:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328156912] [2024-11-09 02:13:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:30,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328156912] [2024-11-09 02:13:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328156912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:13:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235068822] [2024-11-09 02:13:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:30,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:13:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:13:30,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:13:30,467 INFO L87 Difference]: Start difference. First operand 249 states and 355 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:31,397 INFO L93 Difference]: Finished difference Result 456 states and 649 transitions. [2024-11-09 02:13:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:13:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-11-09 02:13:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:31,400 INFO L225 Difference]: With dead ends: 456 [2024-11-09 02:13:31,400 INFO L226 Difference]: Without dead ends: 329 [2024-11-09 02:13:31,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:13:31,403 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 351 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:31,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 511 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:13:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-09 02:13:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 249. [2024-11-09 02:13:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.3284313725490196) internal successors, (271), 204 states have internal predecessors, (271), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:13:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 355 transitions. [2024-11-09 02:13:31,437 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 355 transitions. Word has length 161 [2024-11-09 02:13:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 355 transitions. [2024-11-09 02:13:31,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:13:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 355 transitions. [2024-11-09 02:13:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 02:13:31,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:31,440 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:31,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:13:31,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:31,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1805546709, now seen corresponding path program 1 times [2024-11-09 02:13:31,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:31,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410741926] [2024-11-09 02:13:31,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:31,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410741926] [2024-11-09 02:13:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410741926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:13:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482598830] [2024-11-09 02:13:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:13:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:13:36,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:13:36,321 INFO L87 Difference]: Start difference. First operand 249 states and 355 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 02:13:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:38,440 INFO L93 Difference]: Finished difference Result 595 states and 842 transitions. [2024-11-09 02:13:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:13:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 162 [2024-11-09 02:13:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:38,444 INFO L225 Difference]: With dead ends: 595 [2024-11-09 02:13:38,444 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 02:13:38,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-09 02:13:38,446 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 257 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:38,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 795 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 02:13:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 02:13:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 337. [2024-11-09 02:13:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 286 states have (on average 1.3356643356643356) internal successors, (382), 288 states have internal predecessors, (382), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:13:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-11-09 02:13:38,495 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 162 [2024-11-09 02:13:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:38,496 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-11-09 02:13:38,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 02:13:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-11-09 02:13:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 02:13:38,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:38,498 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:38,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:13:38,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:38,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash 665778695, now seen corresponding path program 1 times [2024-11-09 02:13:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:38,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238001792] [2024-11-09 02:13:38,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238001792] [2024-11-09 02:13:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238001792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739284550] [2024-11-09 02:13:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:38,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:38,798 INFO L87 Difference]: Start difference. First operand 337 states and 474 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:39,049 INFO L93 Difference]: Finished difference Result 556 states and 781 transitions. [2024-11-09 02:13:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-09 02:13:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:39,056 INFO L225 Difference]: With dead ends: 556 [2024-11-09 02:13:39,056 INFO L226 Difference]: Without dead ends: 382 [2024-11-09 02:13:39,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:13:39,058 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 55 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:39,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 681 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:13:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-09 02:13:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 340. [2024-11-09 02:13:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 289 states have (on average 1.3321799307958477) internal successors, (385), 291 states have internal predecessors, (385), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:13:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 477 transitions. [2024-11-09 02:13:39,123 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 477 transitions. Word has length 163 [2024-11-09 02:13:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:39,124 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 477 transitions. [2024-11-09 02:13:39,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 477 transitions. [2024-11-09 02:13:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 02:13:39,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:39,129 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:39,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:13:39,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:39,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2123706096, now seen corresponding path program 1 times [2024-11-09 02:13:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103748081] [2024-11-09 02:13:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:39,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103748081] [2024-11-09 02:13:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103748081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:39,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463342751] [2024-11-09 02:13:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:39,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:39,354 INFO L87 Difference]: Start difference. First operand 340 states and 477 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:39,418 INFO L93 Difference]: Finished difference Result 689 states and 967 transitions. [2024-11-09 02:13:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:39,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-09 02:13:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:39,423 INFO L225 Difference]: With dead ends: 689 [2024-11-09 02:13:39,423 INFO L226 Difference]: Without dead ends: 352 [2024-11-09 02:13:39,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:39,424 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:39,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-09 02:13:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-09 02:13:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 301 states have (on average 1.318936877076412) internal successors, (397), 303 states have internal predecessors, (397), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:13:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-11-09 02:13:39,473 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 163 [2024-11-09 02:13:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:39,474 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-11-09 02:13:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-11-09 02:13:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:13:39,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:39,476 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:39,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:13:39,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash -596019651, now seen corresponding path program 1 times [2024-11-09 02:13:39,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:39,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125359075] [2024-11-09 02:13:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:40,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125359075] [2024-11-09 02:13:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125359075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:13:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437895067] [2024-11-09 02:13:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:13:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:13:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:13:40,872 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:41,403 INFO L93 Difference]: Finished difference Result 593 states and 822 transitions. [2024-11-09 02:13:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:13:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 02:13:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:41,406 INFO L225 Difference]: With dead ends: 593 [2024-11-09 02:13:41,406 INFO L226 Difference]: Without dead ends: 410 [2024-11-09 02:13:41,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:13:41,409 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 234 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:41,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 429 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:13:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-09 02:13:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 361. [2024-11-09 02:13:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 310 states have (on average 1.3193548387096774) internal successors, (409), 312 states have internal predecessors, (409), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:13:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 501 transitions. [2024-11-09 02:13:41,458 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 501 transitions. Word has length 165 [2024-11-09 02:13:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:41,458 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 501 transitions. [2024-11-09 02:13:41,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 501 transitions. [2024-11-09 02:13:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:13:41,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:41,462 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:41,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:13:41,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:41,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:41,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2069601347, now seen corresponding path program 1 times [2024-11-09 02:13:41,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:41,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968034352] [2024-11-09 02:13:41,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968034352] [2024-11-09 02:13:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968034352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:13:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804071789] [2024-11-09 02:13:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:45,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:13:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:45,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:13:45,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:13:45,522 INFO L87 Difference]: Start difference. First operand 361 states and 501 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-09 02:13:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:47,066 INFO L93 Difference]: Finished difference Result 769 states and 1059 transitions. [2024-11-09 02:13:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:13:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2024-11-09 02:13:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:47,069 INFO L225 Difference]: With dead ends: 769 [2024-11-09 02:13:47,070 INFO L226 Difference]: Without dead ends: 411 [2024-11-09 02:13:47,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:13:47,071 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 459 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:47,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 509 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 02:13:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-09 02:13:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 329. [2024-11-09 02:13:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.3071428571428572) internal successors, (366), 281 states have internal predecessors, (366), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 02:13:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 454 transitions. [2024-11-09 02:13:47,122 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 454 transitions. Word has length 165 [2024-11-09 02:13:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:47,123 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 454 transitions. [2024-11-09 02:13:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-09 02:13:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 454 transitions. [2024-11-09 02:13:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:13:47,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:47,125 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:47,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:13:47,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:47,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1376537237, now seen corresponding path program 1 times [2024-11-09 02:13:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687625352] [2024-11-09 02:13:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687625352] [2024-11-09 02:13:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687625352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:47,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:47,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:13:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589359706] [2024-11-09 02:13:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:47,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:13:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:47,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:13:47,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:47,289 INFO L87 Difference]: Start difference. First operand 329 states and 454 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:47,336 INFO L93 Difference]: Finished difference Result 655 states and 905 transitions. [2024-11-09 02:13:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:13:47,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 02:13:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:47,339 INFO L225 Difference]: With dead ends: 655 [2024-11-09 02:13:47,339 INFO L226 Difference]: Without dead ends: 329 [2024-11-09 02:13:47,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:47,341 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:47,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-09 02:13:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-09 02:13:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.2964285714285715) internal successors, (363), 281 states have internal predecessors, (363), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 02:13:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 451 transitions. [2024-11-09 02:13:47,385 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 451 transitions. Word has length 165 [2024-11-09 02:13:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:47,386 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 451 transitions. [2024-11-09 02:13:47,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 451 transitions. [2024-11-09 02:13:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 02:13:47,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:47,388 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:13:47,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2126923603, now seen corresponding path program 1 times [2024-11-09 02:13:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559886747] [2024-11-09 02:13:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:51,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559886747] [2024-11-09 02:13:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559886747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:51,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:51,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 02:13:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954881163] [2024-11-09 02:13:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:51,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:13:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:13:51,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:13:51,448 INFO L87 Difference]: Start difference. First operand 329 states and 451 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-09 02:13:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:53,000 INFO L93 Difference]: Finished difference Result 632 states and 861 transitions. [2024-11-09 02:13:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:13:53,001 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 166 [2024-11-09 02:13:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:53,004 INFO L225 Difference]: With dead ends: 632 [2024-11-09 02:13:53,004 INFO L226 Difference]: Without dead ends: 432 [2024-11-09 02:13:53,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:13:53,005 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 256 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:53,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 616 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:13:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-09 02:13:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 329. [2024-11-09 02:13:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.292857142857143) internal successors, (362), 281 states have internal predecessors, (362), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 02:13:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 450 transitions. [2024-11-09 02:13:53,050 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 450 transitions. Word has length 166 [2024-11-09 02:13:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 450 transitions. [2024-11-09 02:13:53,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-09 02:13:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 450 transitions. [2024-11-09 02:13:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 02:13:53,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:53,052 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:13:53,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 694461997, now seen corresponding path program 1 times [2024-11-09 02:13:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004151021] [2024-11-09 02:13:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:13:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:13:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:13:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:13:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:13:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:13:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 02:13:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:13:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 02:13:55,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:55,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004151021] [2024-11-09 02:13:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004151021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115899302] [2024-11-09 02:13:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:13:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:55,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:13:55,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:13:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:55,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 02:13:55,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:58,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 02:13:58,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2024-11-09 02:13:58,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:58,604 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-09 02:13:58,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2024-11-09 02:13:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 02:13:58,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115899302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:58,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:13:58,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 22 [2024-11-09 02:13:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554650720] [2024-11-09 02:13:58,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:58,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:13:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:13:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:13:58,858 INFO L87 Difference]: Start difference. First operand 329 states and 450 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:59,826 INFO L93 Difference]: Finished difference Result 767 states and 1047 transitions. [2024-11-09 02:13:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:13:59,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-09 02:13:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:59,830 INFO L225 Difference]: With dead ends: 767 [2024-11-09 02:13:59,830 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 02:13:59,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-09 02:13:59,834 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 152 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:59,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 821 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:13:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 02:13:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 358. [2024-11-09 02:13:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 309 states have (on average 1.3009708737864079) internal successors, (402), 310 states have internal predecessors, (402), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 02:13:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 490 transitions. [2024-11-09 02:13:59,886 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 490 transitions. Word has length 166 [2024-11-09 02:13:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:59,886 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 490 transitions. [2024-11-09 02:13:59,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 02:13:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 490 transitions. [2024-11-09 02:13:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 02:13:59,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:59,888 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:59,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:14:00,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 02:14:00,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 835010607, now seen corresponding path program 1 times [2024-11-09 02:14:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:00,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837025290] [2024-11-09 02:14:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:03,807 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: incomplete