./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.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 29b733e97215d9729c0bee0ddf8d5a148e778c069ba15b669920716d39a28aa2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:41:04,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:41:04,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:41:04,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:41:04,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:41:04,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:41:04,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:41:04,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:41:04,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:41:04,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:41:04,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:41:04,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:41:04,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:41:04,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:41:04,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:41:04,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:41:04,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:41:04,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:41:04,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:41:04,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:41:04,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:41:04,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:41:04,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:41:04,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:41:04,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:41:04,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:41:04,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:41:04,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:41:04,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:41:04,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:41:04,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:41:04,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:41:04,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:41:04,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:41:04,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:41:04,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:41:04,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:41:04,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:41:04,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:41:04,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:41:04,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:41:04,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:41:04,264 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 -> 29b733e97215d9729c0bee0ddf8d5a148e778c069ba15b669920716d39a28aa2 [2024-11-08 23:41:04,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:41:04,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:41:04,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:41:04,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:41:04,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:41:04,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i [2024-11-08 23:41:05,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:41:06,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:41:06,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i [2024-11-08 23:41:06,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294aa6b54/257308c587bb4d57bcc48bca2a72f45f/FLAGa806697cf [2024-11-08 23:41:06,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294aa6b54/257308c587bb4d57bcc48bca2a72f45f [2024-11-08 23:41:06,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:41:06,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:41:06,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:41:06,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:41:06,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:41:06,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:06,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad0c519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06, skipping insertion in model container [2024-11-08 23:41:06,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:06,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:41:06,765 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_loopvsstraightlinecode_25-1loop_file-4.i[914,927] [2024-11-08 23:41:06,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:41:06,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:41:06,856 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_loopvsstraightlinecode_25-1loop_file-4.i[914,927] [2024-11-08 23:41:06,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:41:06,912 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:41:06,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06 WrapperNode [2024-11-08 23:41:06,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:41:06,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:41:06,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:41:06,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:41:06,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:06,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:06,967 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-08 23:41:06,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:41:06,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:41:06,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:41:06,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:41:06,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:06,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:06,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,005 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-08 23:41:07,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:41:07,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:41:07,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:41:07,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:41:07,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (1/1) ... [2024-11-08 23:41:07,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:41:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:41:07,068 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-08 23:41:07,072 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-08 23:41:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:41:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:41:07,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:41:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:41:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:41:07,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:41:07,268 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:41:07,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:41:07,561 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 23:41:07,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:41:07,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:41:07,577 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:41:07,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:41:07 BoogieIcfgContainer [2024-11-08 23:41:07,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:41:07,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:41:07,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:41:07,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:41:07,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:41:06" (1/3) ... [2024-11-08 23:41:07,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33356368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:41:07, skipping insertion in model container [2024-11-08 23:41:07,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:06" (2/3) ... [2024-11-08 23:41:07,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33356368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:41:07, skipping insertion in model container [2024-11-08 23:41:07,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:41:07" (3/3) ... [2024-11-08 23:41:07,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-4.i [2024-11-08 23:41:07,597 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:41:07,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:41:07,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:41:07,653 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;@4699b87d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:41:07,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:41:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 23:41:07,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:07,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:07,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:07,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash -395988458, now seen corresponding path program 1 times [2024-11-08 23:41:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273149042] [2024-11-08 23:41:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:08,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:08,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273149042] [2024-11-08 23:41:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273149042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:08,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:41:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496510820] [2024-11-08 23:41:08,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:08,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:41:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:08,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:41:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:41:08,081 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 23:41:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:08,110 INFO L93 Difference]: Finished difference Result 97 states and 158 transitions. [2024-11-08 23:41:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:41:08,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-08 23:41:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:08,122 INFO L225 Difference]: With dead ends: 97 [2024-11-08 23:41:08,122 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 23:41:08,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-08 23:41:08,131 INFO L432 NwaCegarLoop]: 70 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, 70 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-08 23:41:08,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:41:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 23:41:08,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 23:41:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-08 23:41:08,182 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 96 [2024-11-08 23:41:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:08,184 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-08 23:41:08,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 23:41:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-08 23:41:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 23:41:08,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:08,188 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:08,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:41:08,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1172445864, now seen corresponding path program 1 times [2024-11-08 23:41:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147503881] [2024-11-08 23:41:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147503881] [2024-11-08 23:41:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147503881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:41:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839987725] [2024-11-08 23:41:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:11,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:41:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:41:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:41:11,379 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:12,029 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2024-11-08 23:41:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:12,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-11-08 23:41:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:12,033 INFO L225 Difference]: With dead ends: 86 [2024-11-08 23:41:12,033 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 23:41:12,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:41:12,034 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:12,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 277 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:41:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 23:41:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2024-11-08 23:41:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-08 23:41:12,053 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 96 [2024-11-08 23:41:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-08 23:41:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-08 23:41:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:41:12,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:12,060 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:41:12,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2073323580, now seen corresponding path program 1 times [2024-11-08 23:41:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817317639] [2024-11-08 23:41:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817317639] [2024-11-08 23:41:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817317639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:41:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136208400] [2024-11-08 23:41:17,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:17,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:41:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:41:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:41:17,382 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:18,292 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2024-11-08 23:41:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-08 23:41:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:18,294 INFO L225 Difference]: With dead ends: 82 [2024-11-08 23:41:18,294 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 23:41:18,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:41:18,296 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 47 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:18,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 299 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:41:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 23:41:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2024-11-08 23:41:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-08 23:41:18,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 97 [2024-11-08 23:41:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:18,312 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-08 23:41:18,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-08 23:41:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:41:18,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:18,314 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:41:18,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2075170622, now seen corresponding path program 1 times [2024-11-08 23:41:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:18,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041674394] [2024-11-08 23:41:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:20,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041674394] [2024-11-08 23:41:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041674394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:20,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:20,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:41:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678580846] [2024-11-08 23:41:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:20,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:41:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:41:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:41:20,349 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:21,165 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2024-11-08 23:41:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:21,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-08 23:41:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:21,167 INFO L225 Difference]: With dead ends: 78 [2024-11-08 23:41:21,167 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 23:41:21,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:41:21,169 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 67 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:21,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 304 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:41:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 23:41:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2024-11-08 23:41:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-08 23:41:21,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 97 [2024-11-08 23:41:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:21,182 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-08 23:41:21,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-08 23:41:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:41:21,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:21,184 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:21,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:41:21,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1927659678, now seen corresponding path program 1 times [2024-11-08 23:41:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802983847] [2024-11-08 23:41:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802983847] [2024-11-08 23:41:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802983847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:24,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:24,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:41:24,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27470604] [2024-11-08 23:41:24,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:24,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:41:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:24,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:41:24,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:41:24,533 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:25,003 INFO L93 Difference]: Finished difference Result 125 states and 176 transitions. [2024-11-08 23:41:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:41:25,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-08 23:41:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:25,005 INFO L225 Difference]: With dead ends: 125 [2024-11-08 23:41:25,005 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 23:41:25,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:41:25,007 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 37 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:25,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 326 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:41:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 23:41:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2024-11-08 23:41:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2024-11-08 23:41:25,025 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 97 [2024-11-08 23:41:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:25,026 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2024-11-08 23:41:25,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2024-11-08 23:41:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:41:25,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:25,028 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:25,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:41:25,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash -592300256, now seen corresponding path program 1 times [2024-11-08 23:41:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814538986] [2024-11-08 23:41:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:27,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814538986] [2024-11-08 23:41:27,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814538986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:27,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:27,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:41:27,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782049510] [2024-11-08 23:41:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:27,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:41:27,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:27,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:41:27,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:41:27,696 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:28,139 INFO L93 Difference]: Finished difference Result 133 states and 187 transitions. [2024-11-08 23:41:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:41:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-08 23:41:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:28,142 INFO L225 Difference]: With dead ends: 133 [2024-11-08 23:41:28,142 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 23:41:28,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:41:28,145 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:28,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 336 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:41:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 23:41:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2024-11-08 23:41:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-11-08 23:41:28,154 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 97 [2024-11-08 23:41:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:28,154 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-11-08 23:41:28,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-08 23:41:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:41:28,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:28,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:28,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:41:28,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -614530047, now seen corresponding path program 1 times [2024-11-08 23:41:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314688000] [2024-11-08 23:41:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:31,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:31,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314688000] [2024-11-08 23:41:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314688000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:31,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:31,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:41:31,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036346852] [2024-11-08 23:41:31,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:31,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:41:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:41:31,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:41:31,403 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:32,107 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2024-11-08 23:41:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:32,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-08 23:41:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:32,110 INFO L225 Difference]: With dead ends: 84 [2024-11-08 23:41:32,110 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 23:41:32,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:41:32,112 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:32,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 284 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:41:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 23:41:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2024-11-08 23:41:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:41:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-08 23:41:32,121 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 97 [2024-11-08 23:41:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:32,121 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-08 23:41:32,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-08 23:41:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:41:32,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:32,123 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:32,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:41:32,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:32,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash -83752103, now seen corresponding path program 1 times [2024-11-08 23:41:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22163149] [2024-11-08 23:41:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22163149] [2024-11-08 23:41:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22163149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:34,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:34,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:41:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947435041] [2024-11-08 23:41:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:34,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:41:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:41:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:41:34,393 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:34,753 INFO L93 Difference]: Finished difference Result 158 states and 220 transitions. [2024-11-08 23:41:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:34,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-08 23:41:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:34,756 INFO L225 Difference]: With dead ends: 158 [2024-11-08 23:41:34,757 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:41:34,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:41:34,759 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 39 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:34,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:41:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:41:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2024-11-08 23:41:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:41:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2024-11-08 23:41:34,776 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 98 [2024-11-08 23:41:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:34,778 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2024-11-08 23:41:34,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-11-08 23:41:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:41:34,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:34,781 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:34,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:41:34,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:34,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2106122573, now seen corresponding path program 1 times [2024-11-08 23:41:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:34,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101427098] [2024-11-08 23:41:34,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:38,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101427098] [2024-11-08 23:41:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101427098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:38,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:38,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:41:38,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796750205] [2024-11-08 23:41:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:38,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:41:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:38,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:41:38,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:41:38,397 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:39,036 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2024-11-08 23:41:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:41:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-08 23:41:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:39,039 INFO L225 Difference]: With dead ends: 118 [2024-11-08 23:41:39,039 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 23:41:39,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:41:39,040 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:39,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 280 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:41:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 23:41:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 82. [2024-11-08 23:41:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.278688524590164) internal successors, (78), 62 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:41:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-08 23:41:39,051 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 98 [2024-11-08 23:41:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-08 23:41:39,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-08 23:41:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:41:39,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:39,053 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:39,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:41:39,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:39,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2104275531, now seen corresponding path program 1 times [2024-11-08 23:41:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125654575] [2024-11-08 23:41:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:42,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125654575] [2024-11-08 23:41:42,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125654575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:42,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:42,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:41:42,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066680249] [2024-11-08 23:41:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:42,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:41:42,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:42,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:41:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:41:42,378 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:42,973 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2024-11-08 23:41:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:41:42,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-08 23:41:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:42,975 INFO L225 Difference]: With dead ends: 113 [2024-11-08 23:41:42,975 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 23:41:42,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:41:42,976 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 40 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:42,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 354 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:41:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 23:41:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2024-11-08 23:41:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:41:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-08 23:41:42,987 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 98 [2024-11-08 23:41:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:42,987 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-08 23:41:42,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-08 23:41:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:41:42,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:42,989 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:42,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:41:42,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:42,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2043180821, now seen corresponding path program 1 times [2024-11-08 23:41:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:42,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632168408] [2024-11-08 23:41:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:45,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:45,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632168408] [2024-11-08 23:41:45,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632168408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:45,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:45,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:41:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732139983] [2024-11-08 23:41:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:45,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:41:45,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:45,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:41:45,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:41:45,617 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:45,916 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2024-11-08 23:41:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-08 23:41:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:45,918 INFO L225 Difference]: With dead ends: 176 [2024-11-08 23:41:45,918 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 23:41:45,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:41:45,920 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:45,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 266 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:41:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 23:41:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2024-11-08 23:41:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:41:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-08 23:41:45,931 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 98 [2024-11-08 23:41:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:45,932 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-08 23:41:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-08 23:41:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:41:45,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:45,933 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:41:45,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 23:41:45,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -476779113, now seen corresponding path program 1 times [2024-11-08 23:41:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:41:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689591975] [2024-11-08 23:41:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:41:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:41:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:41:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:41:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:41:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:41:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:41:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:41:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:41:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:41:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:41:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:41:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:41:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:41:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:41:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:41:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:41:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:41:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689591975] [2024-11-08 23:41:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689591975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:41:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516871888] [2024-11-08 23:41:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:48,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:41:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:41:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:41:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:41:48,627 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:49,058 INFO L93 Difference]: Finished difference Result 166 states and 228 transitions. [2024-11-08 23:41:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:41:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-08 23:41:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:49,059 INFO L225 Difference]: With dead ends: 166 [2024-11-08 23:41:49,059 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:41:49,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:41:49,060 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:49,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 403 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:41:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:41:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:41:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 23:41:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:41:49,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-11-08 23:41:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:49,061 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:41:49,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:41:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:41:49,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:41:49,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:41:49,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 23:41:49,068 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:41:49,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:41:49,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:41:50,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:41:50 BoogieIcfgContainer [2024-11-08 23:41:50,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:41:50,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:41:50,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:41:50,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:41:50,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:41:07" (3/4) ... [2024-11-08 23:41:50,021 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:41:50,025 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:41:50,031 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 23:41:50,031 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:41:50,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:41:50,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:41:50,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:41:50,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:41:50,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:41:50,158 INFO L158 Benchmark]: Toolchain (without parser) took 43604.96ms. Allocated memory was 148.9MB in the beginning and 778.0MB in the end (delta: 629.1MB). Free memory was 103.8MB in the beginning and 511.9MB in the end (delta: -408.1MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,158 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:41:50,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.96ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 89.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.44ms. Allocated memory is still 148.9MB. Free memory was 89.6MB in the beginning and 86.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,159 INFO L158 Benchmark]: Boogie Preprocessor took 54.11ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 82.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,159 INFO L158 Benchmark]: RCFGBuilder took 555.45ms. Allocated memory is still 148.9MB. Free memory was 82.2MB in the beginning and 106.0MB in the end (delta: -23.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,159 INFO L158 Benchmark]: TraceAbstraction took 42437.74ms. Allocated memory was 148.9MB in the beginning and 778.0MB in the end (delta: 629.1MB). Free memory was 105.2MB in the beginning and 517.2MB in the end (delta: -412.0MB). Peak memory consumption was 454.6MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,160 INFO L158 Benchmark]: Witness Printer took 139.41ms. Allocated memory is still 778.0MB. Free memory was 517.2MB in the beginning and 511.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:41:50,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.96ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 89.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.44ms. Allocated memory is still 148.9MB. Free memory was 89.6MB in the beginning and 86.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.11ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 82.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 555.45ms. Allocated memory is still 148.9MB. Free memory was 82.2MB in the beginning and 106.0MB in the end (delta: -23.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42437.74ms. Allocated memory was 148.9MB in the beginning and 778.0MB in the end (delta: 629.1MB). Free memory was 105.2MB in the beginning and 517.2MB in the end (delta: -412.0MB). Peak memory consumption was 454.6MB. Max. memory is 16.1GB. * Witness Printer took 139.41ms. Allocated memory is still 778.0MB. Free memory was 517.2MB in the beginning and 511.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 12, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 557 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 557 mSDsluCounter, 3765 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3019 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1738 IncrementalHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 746 mSDtfsCounter, 1738 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=9, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 240 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 10721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5040/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((last_1_var_1_9 / var_1_3) < last_1_var_1_9) || (var_1_5 < var_1_6)) || (var_1_6 == var_1_1)) && ((((last_1_var_1_9 / var_1_3) < last_1_var_1_9) || (var_1_6 < (var_1_5 + 1))) || (var_1_1 == var_1_5))) || (0 <= ((int) var_1_3 + last_1_var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_9 == \old(last_1_var_1_9))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:41:50,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE