./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_fillercode_fillercodestructure_filler-pe-co_file-66.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 e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:19:34,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:19:34,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:19:34,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:19:34,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:19:34,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:19:34,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:19:34,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:19:34,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:19:34,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:19:34,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:19:34,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:19:34,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:19:34,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:19:34,700 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:19:34,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:19:34,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:19:34,701 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:19:34,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:19:34,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:19:34,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:19:34,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:19:34,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:19:34,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:19:34,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:19:34,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:19:34,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:19:34,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:19:34,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:19:34,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:19:34,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:19:34,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:19:34,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:19:34,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:19:34,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:19:34,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:19:34,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:19:34,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:19:34,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:19:34,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:19:34,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:19:34,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:19:34,706 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 -> e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 [2024-11-10 05:19:34,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:19:34,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:19:34,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:19:34,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:19:34,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:19:34,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2024-11-10 05:19:36,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:19:36,295 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:19:36,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2024-11-10 05:19:36,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb80a7bd0/ab67c50d07014b43b9f975af70061ac3/FLAGbaacf2fa8 [2024-11-10 05:19:36,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb80a7bd0/ab67c50d07014b43b9f975af70061ac3 [2024-11-10 05:19:36,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:19:36,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:19:36,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:19:36,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:19:36,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:19:36,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:19:36" (1/1) ... [2024-11-10 05:19:36,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b53b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:36, skipping insertion in model container [2024-11-10 05:19:36,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:19:36" (1/1) ... [2024-11-10 05:19:36,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:19:36,876 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_fillercode_fillercodestructure_filler-pe-co_file-66.i[919,932] [2024-11-10 05:19:36,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:19:36,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:19:36,968 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_fillercode_fillercodestructure_filler-pe-co_file-66.i[919,932] [2024-11-10 05:19:37,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:19:37,023 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:19:37,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37 WrapperNode [2024-11-10 05:19:37,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:19:37,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:19:37,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:19:37,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:19:37,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,077 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-10 05:19:37,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:19:37,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:19:37,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:19:37,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:19:37,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,115 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:19:37,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:19:37,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:19:37,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:19:37,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:19:37,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (1/1) ... [2024-11-10 05:19:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:19:37,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:19:37,161 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-10 05:19:37,163 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-10 05:19:37,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:19:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:19:37,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:19:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:19:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:19:37,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:19:37,322 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:19:37,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:19:37,617 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 05:19:37,618 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:19:37,628 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:19:37,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:19:37,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:19:37 BoogieIcfgContainer [2024-11-10 05:19:37,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:19:37,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:19:37,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:19:37,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:19:37,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:19:36" (1/3) ... [2024-11-10 05:19:37,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:19:37, skipping insertion in model container [2024-11-10 05:19:37,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:19:37" (2/3) ... [2024-11-10 05:19:37,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:19:37, skipping insertion in model container [2024-11-10 05:19:37,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:19:37" (3/3) ... [2024-11-10 05:19:37,637 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2024-11-10 05:19:37,649 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:19:37,649 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:19:37,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:19:37,705 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;@31d0f832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:19:37,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:19:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 05:19:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:19:37,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:19:37,722 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:19:37,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:19:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:19:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 131566156, now seen corresponding path program 1 times [2024-11-10 05:19:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:19:37,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047712999] [2024-11-10 05:19:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:19:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:19:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:19:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:19:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:19:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:19:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:19:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:19:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:19:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:19:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:19:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:19:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:19:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:19:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:19:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:19:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:37,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:19:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:19:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:19:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:19:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:19:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:19:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:19:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:19:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:19:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:19:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:19:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:19:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047712999] [2024-11-10 05:19:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047712999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:19:38,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:19:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:19:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284089035] [2024-11-10 05:19:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:19:38,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:19:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:19:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:19:38,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:19:38,075 INFO L87 Difference]: Start difference. First operand has 87 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:19:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:19:38,101 INFO L93 Difference]: Finished difference Result 166 states and 289 transitions. [2024-11-10 05:19:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:19:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-11-10 05:19:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:19:38,110 INFO L225 Difference]: With dead ends: 166 [2024-11-10 05:19:38,110 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 05:19:38,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10 05:19:38,116 INFO L432 NwaCegarLoop]: 128 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, 128 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-10 05:19:38,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:19:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 05:19:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 05:19:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 05:19:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2024-11-10 05:19:38,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 162 [2024-11-10 05:19:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:19:38,152 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2024-11-10 05:19:38,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:19:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2024-11-10 05:19:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:19:38,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:19:38,155 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:19:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:19:38,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:19:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:19:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1868600402, now seen corresponding path program 1 times [2024-11-10 05:19:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:19:38,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133887447] [2024-11-10 05:19:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:19:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:19:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:19:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:19:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:19:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:19:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:19:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:19:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:19:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:19:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:19:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:19:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:19:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:19:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:19:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:19:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:19:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:19:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:19:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:19:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:19:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:19:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:19:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:19:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:19:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:19:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:19:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:19:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133887447] [2024-11-10 05:19:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133887447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:19:38,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:19:38,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:19:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727003572] [2024-11-10 05:19:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:19:38,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:19:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:19:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:19:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:19:38,433 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:19:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:19:38,502 INFO L93 Difference]: Finished difference Result 238 states and 374 transitions. [2024-11-10 05:19:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:19:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:19:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:19:38,507 INFO L225 Difference]: With dead ends: 238 [2024-11-10 05:19:38,508 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 05:19:38,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10 05:19:38,509 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:19:38,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 227 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:19:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 05:19:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-11-10 05:19:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 05:19:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 241 transitions. [2024-11-10 05:19:38,538 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 241 transitions. Word has length 162 [2024-11-10 05:19:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:19:38,540 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 241 transitions. [2024-11-10 05:19:38,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:19:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 241 transitions. [2024-11-10 05:19:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:19:38,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:19:38,543 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:19:38,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:19:38,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:19:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:19:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1358066225, now seen corresponding path program 1 times [2024-11-10 05:19:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:19:38,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924551560] [2024-11-10 05:19:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:19:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:19:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:19:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:19:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:19:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:19:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:19:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:19:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:19:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:19:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:19:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:19:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:19:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:19:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:19:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:19:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:19:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:19:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:19:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:19:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:19:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:19:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:19:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:19:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:19:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:19:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:19:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:19:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:19:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924551560] [2024-11-10 05:19:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924551560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:19:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:19:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 05:19:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094545185] [2024-11-10 05:19:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:19:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 05:19:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:19:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 05:19:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:19:43,997 INFO L87 Difference]: Start difference. First operand 156 states and 241 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:19:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:19:46,257 INFO L93 Difference]: Finished difference Result 611 states and 916 transitions. [2024-11-10 05:19:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 05:19:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:19:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:19:46,260 INFO L225 Difference]: With dead ends: 611 [2024-11-10 05:19:46,260 INFO L226 Difference]: Without dead ends: 458 [2024-11-10 05:19:46,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:19:46,264 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 497 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:19:46,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 737 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 05:19:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-10 05:19:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 266. [2024-11-10 05:19:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 205 states have (on average 1.4390243902439024) internal successors, (295), 207 states have internal predecessors, (295), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:19:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 407 transitions. [2024-11-10 05:19:46,299 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 407 transitions. Word has length 162 [2024-11-10 05:19:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:19:46,304 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 407 transitions. [2024-11-10 05:19:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:19:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 407 transitions. [2024-11-10 05:19:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:19:46,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:19:46,307 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:19:46,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:19:46,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:19:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:19:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1651469232, now seen corresponding path program 1 times [2024-11-10 05:19:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:19:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347534486] [2024-11-10 05:19:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:19:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:19:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347534486] [2024-11-10 05:20:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347534486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:02,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 05:20:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50546432] [2024-11-10 05:20:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:02,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 05:20:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:02,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 05:20:02,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:20:02,446 INFO L87 Difference]: Start difference. First operand 266 states and 407 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:03,653 INFO L93 Difference]: Finished difference Result 435 states and 645 transitions. [2024-11-10 05:20:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 05:20:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:20:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:03,655 INFO L225 Difference]: With dead ends: 435 [2024-11-10 05:20:03,656 INFO L226 Difference]: Without dead ends: 432 [2024-11-10 05:20:03,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:20:03,657 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 389 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:03,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 610 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:20:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-10 05:20:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 269. [2024-11-10 05:20:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 208 states have (on average 1.4423076923076923) internal successors, (300), 210 states have internal predecessors, (300), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:20:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2024-11-10 05:20:03,677 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 162 [2024-11-10 05:20:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2024-11-10 05:20:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2024-11-10 05:20:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:20:03,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:03,681 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:03,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:20:03,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:03,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash -4756528, now seen corresponding path program 1 times [2024-11-10 05:20:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674599827] [2024-11-10 05:20:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674599827] [2024-11-10 05:20:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674599827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 05:20:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750896204] [2024-11-10 05:20:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:08,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 05:20:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:08,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 05:20:08,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:20:08,024 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:10,084 INFO L93 Difference]: Finished difference Result 464 states and 685 transitions. [2024-11-10 05:20:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 05:20:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:20:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:10,087 INFO L225 Difference]: With dead ends: 464 [2024-11-10 05:20:10,087 INFO L226 Difference]: Without dead ends: 461 [2024-11-10 05:20:10,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:20:10,089 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 541 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:10,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 689 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 05:20:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-10 05:20:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 273. [2024-11-10 05:20:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 212 states have (on average 1.4433962264150944) internal successors, (306), 214 states have internal predecessors, (306), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:20:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 418 transitions. [2024-11-10 05:20:10,119 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 418 transitions. Word has length 162 [2024-11-10 05:20:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 418 transitions. [2024-11-10 05:20:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 418 transitions. [2024-11-10 05:20:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:20:10,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:10,121 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:10,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:20:10,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:10,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -298159535, now seen corresponding path program 1 times [2024-11-10 05:20:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:10,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169303227] [2024-11-10 05:20:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169303227] [2024-11-10 05:20:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169303227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:33,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 05:20:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2896947] [2024-11-10 05:20:33,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:33,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 05:20:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:33,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 05:20:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:20:33,833 INFO L87 Difference]: Start difference. First operand 273 states and 418 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:35,179 INFO L93 Difference]: Finished difference Result 434 states and 646 transitions. [2024-11-10 05:20:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 05:20:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:20:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:35,181 INFO L225 Difference]: With dead ends: 434 [2024-11-10 05:20:35,181 INFO L226 Difference]: Without dead ends: 431 [2024-11-10 05:20:35,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:20:35,182 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 386 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:35,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 913 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 05:20:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-10 05:20:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 271. [2024-11-10 05:20:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 210 states have (on average 1.4428571428571428) internal successors, (303), 212 states have internal predecessors, (303), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:20:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 415 transitions. [2024-11-10 05:20:35,197 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 415 transitions. Word has length 162 [2024-11-10 05:20:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:35,198 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 415 transitions. [2024-11-10 05:20:35,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 415 transitions. [2024-11-10 05:20:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:20:35,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:35,199 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:35,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:20:35,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2017542669, now seen corresponding path program 1 times [2024-11-10 05:20:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313887845] [2024-11-10 05:20:35,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313887845] [2024-11-10 05:20:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313887845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:20:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456194362] [2024-11-10 05:20:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:35,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:20:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:20:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:20:35,357 INFO L87 Difference]: Start difference. First operand 271 states and 415 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:35,558 INFO L93 Difference]: Finished difference Result 904 states and 1381 transitions. [2024-11-10 05:20:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:20:35,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:20:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:35,563 INFO L225 Difference]: With dead ends: 904 [2024-11-10 05:20:35,563 INFO L226 Difference]: Without dead ends: 636 [2024-11-10 05:20:35,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:20:35,564 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 135 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:35,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 483 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:20:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-10 05:20:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 491. [2024-11-10 05:20:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 370 states have (on average 1.4486486486486487) internal successors, (536), 374 states have internal predecessors, (536), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-10 05:20:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 760 transitions. [2024-11-10 05:20:35,595 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 760 transitions. Word has length 162 [2024-11-10 05:20:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:35,596 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 760 transitions. [2024-11-10 05:20:35,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 760 transitions. [2024-11-10 05:20:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:20:35,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:35,597 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:35,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:20:35,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:35,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1766890450, now seen corresponding path program 1 times [2024-11-10 05:20:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:35,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884124519] [2024-11-10 05:20:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884124519] [2024-11-10 05:20:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884124519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:35,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:20:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865144481] [2024-11-10 05:20:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:35,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:20:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:35,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:20:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:20:35,665 INFO L87 Difference]: Start difference. First operand 491 states and 760 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:35,712 INFO L93 Difference]: Finished difference Result 938 states and 1451 transitions. [2024-11-10 05:20:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:20:35,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-10 05:20:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:35,715 INFO L225 Difference]: With dead ends: 938 [2024-11-10 05:20:35,715 INFO L226 Difference]: Without dead ends: 450 [2024-11-10 05:20:35,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10 05:20:35,719 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 111 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:35,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 335 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:20:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-10 05:20:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2024-11-10 05:20:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 329 states have (on average 1.3525835866261398) internal successors, (445), 332 states have internal predecessors, (445), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:20:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 661 transitions. [2024-11-10 05:20:35,750 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 661 transitions. Word has length 162 [2024-11-10 05:20:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:35,750 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 661 transitions. [2024-11-10 05:20:35,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:20:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 661 transitions. [2024-11-10 05:20:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:20:35,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:35,752 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:35,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 05:20:35,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:35,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:35,753 INFO L85 PathProgramCache]: Analyzing trace with hash -924114930, now seen corresponding path program 1 times [2024-11-10 05:20:35,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:35,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700815124] [2024-11-10 05:20:35,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700815124] [2024-11-10 05:20:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700815124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:38,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:38,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 05:20:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351814585] [2024-11-10 05:20:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:38,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 05:20:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 05:20:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:20:38,304 INFO L87 Difference]: Start difference. First operand 446 states and 661 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-10 05:20:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:40,115 INFO L93 Difference]: Finished difference Result 1031 states and 1477 transitions. [2024-11-10 05:20:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 05:20:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 162 [2024-11-10 05:20:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:40,120 INFO L225 Difference]: With dead ends: 1031 [2024-11-10 05:20:40,121 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 05:20:40,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2024-11-10 05:20:40,123 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 671 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:40,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1035 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 05:20:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 05:20:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 473. [2024-11-10 05:20:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 354 states have (on average 1.347457627118644) internal successors, (477), 357 states have internal predecessors, (477), 106 states have call successors, (106), 12 states have call predecessors, (106), 12 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-10 05:20:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 689 transitions. [2024-11-10 05:20:40,164 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 689 transitions. Word has length 162 [2024-11-10 05:20:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 689 transitions. [2024-11-10 05:20:40,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-10 05:20:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 689 transitions. [2024-11-10 05:20:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:20:40,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:40,168 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:40,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 05:20:40,168 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:40,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1146715312, now seen corresponding path program 1 times [2024-11-10 05:20:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496371421] [2024-11-10 05:20:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496371421] [2024-11-10 05:20:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496371421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:20:40,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137462673] [2024-11-10 05:20:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:40,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:20:40,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:20:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:20:40,402 INFO L87 Difference]: Start difference. First operand 473 states and 689 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:20:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:40,645 INFO L93 Difference]: Finished difference Result 942 states and 1363 transitions. [2024-11-10 05:20:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:20:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-11-10 05:20:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:40,648 INFO L225 Difference]: With dead ends: 942 [2024-11-10 05:20:40,648 INFO L226 Difference]: Without dead ends: 534 [2024-11-10 05:20:40,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:20:40,650 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 204 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:40,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 244 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:20:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-10 05:20:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 479. [2024-11-10 05:20:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 354 states have (on average 1.3333333333333333) internal successors, (472), 357 states have internal predecessors, (472), 110 states have call successors, (110), 14 states have call predecessors, (110), 14 states have return successors, (110), 107 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 05:20:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 692 transitions. [2024-11-10 05:20:40,692 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 692 transitions. Word has length 162 [2024-11-10 05:20:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:40,692 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 692 transitions. [2024-11-10 05:20:40,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:20:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 692 transitions. [2024-11-10 05:20:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:20:40,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:40,694 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 05:20:40,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1852878671, now seen corresponding path program 1 times [2024-11-10 05:20:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305361256] [2024-11-10 05:20:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305361256] [2024-11-10 05:20:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305361256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:41,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 05:20:41,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290830676] [2024-11-10 05:20:41,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:41,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 05:20:41,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 05:20:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:20:41,356 INFO L87 Difference]: Start difference. First operand 479 states and 692 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-10 05:20:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:42,471 INFO L93 Difference]: Finished difference Result 1212 states and 1699 transitions. [2024-11-10 05:20:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 05:20:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 163 [2024-11-10 05:20:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:42,476 INFO L225 Difference]: With dead ends: 1212 [2024-11-10 05:20:42,476 INFO L226 Difference]: Without dead ends: 934 [2024-11-10 05:20:42,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-10 05:20:42,478 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 594 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:42,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1090 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:20:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-11-10 05:20:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 486. [2024-11-10 05:20:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 361 states have (on average 1.332409972299169) internal successors, (481), 363 states have internal predecessors, (481), 108 states have call successors, (108), 16 states have call predecessors, (108), 16 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:20:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 697 transitions. [2024-11-10 05:20:42,531 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 697 transitions. Word has length 163 [2024-11-10 05:20:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:42,532 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 697 transitions. [2024-11-10 05:20:42,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-10 05:20:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 697 transitions. [2024-11-10 05:20:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:20:42,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:42,534 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 05:20:42,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash -499568974, now seen corresponding path program 1 times [2024-11-10 05:20:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530498839] [2024-11-10 05:20:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530498839] [2024-11-10 05:20:44,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530498839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:44,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:44,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 05:20:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73019266] [2024-11-10 05:20:44,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 05:20:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:44,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 05:20:44,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:20:44,936 INFO L87 Difference]: Start difference. First operand 486 states and 697 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:20:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:46,927 INFO L93 Difference]: Finished difference Result 1198 states and 1689 transitions. [2024-11-10 05:20:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 05:20:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2024-11-10 05:20:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:46,932 INFO L225 Difference]: With dead ends: 1198 [2024-11-10 05:20:46,932 INFO L226 Difference]: Without dead ends: 775 [2024-11-10 05:20:46,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:20:46,933 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 331 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:46,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 903 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 05:20:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-10 05:20:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 569. [2024-11-10 05:20:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 438 states have (on average 1.3470319634703196) internal successors, (590), 442 states have internal predecessors, (590), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-10 05:20:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 814 transitions. [2024-11-10 05:20:46,996 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 814 transitions. Word has length 163 [2024-11-10 05:20:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 814 transitions. [2024-11-10 05:20:46,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:20:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 814 transitions. [2024-11-10 05:20:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:20:46,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:46,999 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:46,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 05:20:46,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:46,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -792971981, now seen corresponding path program 1 times [2024-11-10 05:20:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:47,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062648573] [2024-11-10 05:20:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:50,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062648573] [2024-11-10 05:20:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062648573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 05:20:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755470145] [2024-11-10 05:20:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:50,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 05:20:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 05:20:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:20:50,296 INFO L87 Difference]: Start difference. First operand 569 states and 814 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:20:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:20:53,253 INFO L93 Difference]: Finished difference Result 1711 states and 2405 transitions. [2024-11-10 05:20:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 05:20:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2024-11-10 05:20:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:20:53,257 INFO L225 Difference]: With dead ends: 1711 [2024-11-10 05:20:53,257 INFO L226 Difference]: Without dead ends: 1205 [2024-11-10 05:20:53,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-11-10 05:20:53,259 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 470 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:20:53,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1180 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 05:20:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2024-11-10 05:20:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 642. [2024-11-10 05:20:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 511 states have (on average 1.36986301369863) internal successors, (700), 515 states have internal predecessors, (700), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-10 05:20:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 924 transitions. [2024-11-10 05:20:53,333 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 924 transitions. Word has length 163 [2024-11-10 05:20:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:20:53,333 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 924 transitions. [2024-11-10 05:20:53,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:20:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 924 transitions. [2024-11-10 05:20:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:20:53,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:20:53,334 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:20:53,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 05:20:53,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:20:53,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:20:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash -581621068, now seen corresponding path program 1 times [2024-11-10 05:20:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:20:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019976226] [2024-11-10 05:20:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:20:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:20:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:20:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:20:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:20:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:20:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:20:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:20:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:20:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:20:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:20:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:20:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:20:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:20:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:20:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:20:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:20:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:20:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:20:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:20:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:20:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:20:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:20:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:20:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:20:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:20:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:20:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:20:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:20:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019976226] [2024-11-10 05:20:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019976226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:20:57,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:20:57,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 05:20:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526184680] [2024-11-10 05:20:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:20:57,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 05:20:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:20:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 05:20:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:20:57,431 INFO L87 Difference]: Start difference. First operand 642 states and 924 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:21:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:21:01,834 INFO L93 Difference]: Finished difference Result 1695 states and 2438 transitions. [2024-11-10 05:21:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 05:21:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2024-11-10 05:21:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:21:01,838 INFO L225 Difference]: With dead ends: 1695 [2024-11-10 05:21:01,838 INFO L226 Difference]: Without dead ends: 1246 [2024-11-10 05:21:01,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2024-11-10 05:21:01,840 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 495 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:21:01,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1175 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 05:21:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-10 05:21:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 686. [2024-11-10 05:21:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 555 states have (on average 1.3747747747747747) internal successors, (763), 559 states have internal predecessors, (763), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-10 05:21:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 987 transitions. [2024-11-10 05:21:01,933 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 987 transitions. Word has length 163 [2024-11-10 05:21:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:21:01,934 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 987 transitions. [2024-11-10 05:21:01,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 05:21:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 987 transitions. [2024-11-10 05:21:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:21:01,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:21:01,935 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:21:01,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 05:21:01,935 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:21:01,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:21:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 663143413, now seen corresponding path program 1 times [2024-11-10 05:21:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:21:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688485404] [2024-11-10 05:21:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:21:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:21:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:21:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:21:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:21:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:21:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:21:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:21:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:21:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:21:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:21:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:21:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:21:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:21:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:21:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:21:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:21:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:21:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:21:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:21:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:21:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:21:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:21:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:21:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:21:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:21:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 05:21:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:21:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688485404] [2024-11-10 05:21:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688485404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:21:02,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:21:02,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:21:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187499617] [2024-11-10 05:21:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:21:02,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:21:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:21:02,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:21:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:21:02,087 INFO L87 Difference]: Start difference. First operand 686 states and 987 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:21:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:21:02,305 INFO L93 Difference]: Finished difference Result 1841 states and 2666 transitions. [2024-11-10 05:21:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:21:02,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-11-10 05:21:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:21:02,315 INFO L225 Difference]: With dead ends: 1841 [2024-11-10 05:21:02,315 INFO L226 Difference]: Without dead ends: 1218 [2024-11-10 05:21:02,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:21:02,318 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 221 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:21:02,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 493 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:21:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-10 05:21:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 848. [2024-11-10 05:21:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 688 states have (on average 1.375) internal successors, (946), 693 states have internal predecessors, (946), 138 states have call successors, (138), 21 states have call predecessors, (138), 21 states have return successors, (138), 133 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-10 05:21:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1222 transitions. [2024-11-10 05:21:02,420 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1222 transitions. Word has length 163 [2024-11-10 05:21:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:21:02,420 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1222 transitions. [2024-11-10 05:21:02,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 05:21:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1222 transitions. [2024-11-10 05:21:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:21:02,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:21:02,422 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:21:02,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 05:21:02,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:21:02,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:21:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash -321128880, now seen corresponding path program 1 times [2024-11-10 05:21:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:21:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892836529] [2024-11-10 05:21:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:21:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:21:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:21:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:21:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:21:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:21:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:21:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:21:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:21:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:21:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:21:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:21:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:21:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:21:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:21:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:21:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:21:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:21:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:21:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:21:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:21:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:21:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:21:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:21:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:21:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:21:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 05:21:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:21:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892836529] [2024-11-10 05:21:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892836529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:21:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059135205] [2024-11-10 05:21:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:21:03,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:21:03,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:21:03,381 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-10 05:21:03,382 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-10 05:21:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:21:03,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 05:21:03,491 INFO L278 TraceCheckSpWp]: Computing forward predicates...