./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.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 f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:35:01,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:35:01,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:35:01,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:35:01,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:35:01,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:35:01,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:35:01,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:35:01,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:35:01,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:35:01,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:35:01,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:35:01,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:35:01,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:35:01,316 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:35:01,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:35:01,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:35:01,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:35:01,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:35:01,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:35:01,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:35:01,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:35:01,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:35:01,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:35:01,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:35:01,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:35:01,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:35:01,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:35:01,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:35:01,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:35:01,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:35:01,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:35:01,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:35:01,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:35:01,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:35:01,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:35:01,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:35:01,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:35:01,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:35:01,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:35:01,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:35:01,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:35:01,332 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 -> f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b [2024-10-13 04:35:01,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:35:01,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:35:01,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:35:01,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:35:01,600 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:35:01,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-10-13 04:35:03,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:35:03,215 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:35:03,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-10-13 04:35:03,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9ad5c04/7475330c5cad4b508a68679780ded869/FLAG1ec835c12 [2024-10-13 04:35:03,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9ad5c04/7475330c5cad4b508a68679780ded869 [2024-10-13 04:35:03,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:35:03,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:35:03,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:35:03,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:35:03,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:35:03,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:03,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143aaf5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03, skipping insertion in model container [2024-10-13 04:35:03,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:03,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:35:03,830 WARN L248 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_50-1loop_file-86.i[915,928] [2024-10-13 04:35:03,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:35:03,910 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:35:03,922 WARN L248 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_50-1loop_file-86.i[915,928] [2024-10-13 04:35:03,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:35:03,971 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:35:03,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03 WrapperNode [2024-10-13 04:35:03,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:35:03,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:35:03,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:35:03,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:35:04,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,085 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-13 04:35:04,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:35:04,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:35:04,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:35:04,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:35:04,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,122 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-10-13 04:35:04,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:35:04,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:35:04,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:35:04,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:35:04,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (1/1) ... [2024-10-13 04:35:04,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:35:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:35:04,190 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-10-13 04:35:04,195 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-10-13 04:35:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:35:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:35:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:35:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:35:04,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:35:04,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:35:04,325 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:35:04,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:35:04,651 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 04:35:04,653 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:35:04,696 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:35:04,696 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:35:04,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:35:04 BoogieIcfgContainer [2024-10-13 04:35:04,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:35:04,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:35:04,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:35:04,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:35:04,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:35:03" (1/3) ... [2024-10-13 04:35:04,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4304d045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:35:04, skipping insertion in model container [2024-10-13 04:35:04,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:35:03" (2/3) ... [2024-10-13 04:35:04,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4304d045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:35:04, skipping insertion in model container [2024-10-13 04:35:04,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:35:04" (3/3) ... [2024-10-13 04:35:04,706 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-10-13 04:35:04,723 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:35:04,723 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:35:04,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:35:04,780 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;@1c3ed7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:35:04,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:35:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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-10-13 04:35:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 04:35:04,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:04,797 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-10-13 04:35:04,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1864465112, now seen corresponding path program 1 times [2024-10-13 04:35:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448465648] [2024-10-13 04:35:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448465648] [2024-10-13 04:35:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448465648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:05,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:35:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544340486] [2024-10-13 04:35:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:05,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:35:05,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:35:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:35:05,272 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-13 04:35:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:05,329 INFO L93 Difference]: Finished difference Result 97 states and 166 transitions. [2024-10-13 04:35:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:35:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 97 [2024-10-13 04:35:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:05,341 INFO L225 Difference]: With dead ends: 97 [2024-10-13 04:35:05,341 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:35:05,346 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-10-13 04:35:05,351 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:05,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:35:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:35:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 04:35:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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-10-13 04:35:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-13 04:35:05,403 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 97 [2024-10-13 04:35:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-13 04:35:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-13 04:35:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-13 04:35:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 04:35:05,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:05,411 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-10-13 04:35:05,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:35:05,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:05,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1284762918, now seen corresponding path program 1 times [2024-10-13 04:35:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534539107] [2024-10-13 04:35:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534539107] [2024-10-13 04:35:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534539107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:35:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602016701] [2024-10-13 04:35:05,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:05,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:35:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:35:05,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:35:05,926 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-10-13 04:35:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:06,163 INFO L93 Difference]: Finished difference Result 140 states and 212 transitions. [2024-10-13 04:35:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:35:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-10-13 04:35:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:06,169 INFO L225 Difference]: With dead ends: 140 [2024-10-13 04:35:06,169 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 04:35:06,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:35:06,171 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:06,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:35:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 04:35:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-10-13 04:35:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 04:35:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-10-13 04:35:06,203 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 97 [2024-10-13 04:35:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:06,204 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-10-13 04:35:06,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-10-13 04:35:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-10-13 04:35:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 04:35:06,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:06,207 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-10-13 04:35:06,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:35:06,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:06,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 697956904, now seen corresponding path program 1 times [2024-10-13 04:35:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123348334] [2024-10-13 04:35:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123348334] [2024-10-13 04:35:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123348334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 04:35:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323453882] [2024-10-13 04:35:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 04:35:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 04:35:12,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:35:12,871 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-10-13 04:35:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:13,874 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2024-10-13 04:35:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:35:13,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-10-13 04:35:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:13,878 INFO L225 Difference]: With dead ends: 192 [2024-10-13 04:35:13,878 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 04:35:13,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-10-13 04:35:13,880 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 203 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:13,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 391 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:35:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 04:35:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2024-10-13 04:35:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 04:35:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-10-13 04:35:13,898 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 97 [2024-10-13 04:35:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:13,899 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-10-13 04:35:13,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-10-13 04:35:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-10-13 04:35:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 04:35:13,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:13,901 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-10-13 04:35:13,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:35:13,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash 304929894, now seen corresponding path program 1 times [2024-10-13 04:35:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:13,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122417854] [2024-10-13 04:35:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:13,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122417854] [2024-10-13 04:35:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122417854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:35:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412112283] [2024-10-13 04:35:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:14,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:35:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:35:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:35:14,031 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-10-13 04:35:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:14,087 INFO L93 Difference]: Finished difference Result 182 states and 273 transitions. [2024-10-13 04:35:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:35:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-10-13 04:35:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:14,090 INFO L225 Difference]: With dead ends: 182 [2024-10-13 04:35:14,090 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 04:35:14,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:35:14,093 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:14,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:35:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 04:35:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-10-13 04:35:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2024-10-13 04:35:14,125 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 97 [2024-10-13 04:35:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:14,127 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2024-10-13 04:35:14,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-10-13 04:35:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2024-10-13 04:35:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:35:14,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:14,132 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-10-13 04:35:14,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:35:14,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:14,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1817372079, now seen corresponding path program 1 times [2024-10-13 04:35:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201058969] [2024-10-13 04:35:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201058969] [2024-10-13 04:35:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201058969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:14,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:14,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:35:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548269365] [2024-10-13 04:35:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:14,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:35:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:35:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:35:14,420 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-10-13 04:35:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:14,455 INFO L93 Difference]: Finished difference Result 235 states and 349 transitions. [2024-10-13 04:35:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:35:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-10-13 04:35:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:14,459 INFO L225 Difference]: With dead ends: 235 [2024-10-13 04:35:14,459 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 04:35:14,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:35:14,465 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:14,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:35:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 04:35:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2024-10-13 04:35:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-10-13 04:35:14,492 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 98 [2024-10-13 04:35:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-10-13 04:35:14,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-10-13 04:35:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-10-13 04:35:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:35:14,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:14,498 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-10-13 04:35:14,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:35:14,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1874630381, now seen corresponding path program 1 times [2024-10-13 04:35:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842246560] [2024-10-13 04:35:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842246560] [2024-10-13 04:35:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842246560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:18,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 04:35:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467396302] [2024-10-13 04:35:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 04:35:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 04:35:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:35:18,023 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-10-13 04:35:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:19,477 INFO L93 Difference]: Finished difference Result 186 states and 254 transitions. [2024-10-13 04:35:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:35:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-10-13 04:35:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:19,479 INFO L225 Difference]: With dead ends: 186 [2024-10-13 04:35:19,479 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 04:35:19,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-10-13 04:35:19,481 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 253 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:19,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 309 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:35:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 04:35:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2024-10-13 04:35:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-10-13 04:35:19,498 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 98 [2024-10-13 04:35:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-10-13 04:35:19,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-10-13 04:35:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-10-13 04:35:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:35:19,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:19,500 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-10-13 04:35:19,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:35:19,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:19,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 161647881, now seen corresponding path program 1 times [2024-10-13 04:35:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986547513] [2024-10-13 04:35:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:23,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986547513] [2024-10-13 04:35:23,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986547513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:23,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:23,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 04:35:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200023546] [2024-10-13 04:35:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:23,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 04:35:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 04:35:23,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:35:23,625 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-10-13 04:35:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:25,841 INFO L93 Difference]: Finished difference Result 182 states and 250 transitions. [2024-10-13 04:35:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 04:35:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-10-13 04:35:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:25,843 INFO L225 Difference]: With dead ends: 182 [2024-10-13 04:35:25,843 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 04:35:25,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2024-10-13 04:35:25,845 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 243 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:25,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 291 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 04:35:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 04:35:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 135. [2024-10-13 04:35:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2024-10-13 04:35:25,877 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 98 [2024-10-13 04:35:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:25,878 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2024-10-13 04:35:25,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-10-13 04:35:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2024-10-13 04:35:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:35:25,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:25,879 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-10-13 04:35:25,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:35:25,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:25,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:25,880 INFO L85 PathProgramCache]: Analyzing trace with hash 197735856, now seen corresponding path program 1 times [2024-10-13 04:35:25,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:25,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130888468] [2024-10-13 04:35:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:30,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130888468] [2024-10-13 04:35:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130888468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 04:35:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655251475] [2024-10-13 04:35:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:30,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 04:35:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 04:35:30,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:35:30,482 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-10-13 04:35:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:33,035 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2024-10-13 04:35:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:35:33,035 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-10-13 04:35:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:33,037 INFO L225 Difference]: With dead ends: 199 [2024-10-13 04:35:33,037 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 04:35:33,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2024-10-13 04:35:33,040 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 237 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:33,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 328 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:35:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 04:35:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2024-10-13 04:35:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-13 04:35:33,067 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-13 04:35:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:33,067 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-13 04:35:33,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-10-13 04:35:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-13 04:35:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:35:33,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:33,069 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-10-13 04:35:33,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 04:35:33,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:33,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash -611610770, now seen corresponding path program 1 times [2024-10-13 04:35:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:33,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136556254] [2024-10-13 04:35:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:37,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136556254] [2024-10-13 04:35:37,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136556254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:37,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 04:35:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202623002] [2024-10-13 04:35:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:37,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 04:35:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 04:35:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 04:35:37,159 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 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-10-13 04:35:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:39,704 INFO L93 Difference]: Finished difference Result 193 states and 264 transitions. [2024-10-13 04:35:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 04:35:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 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 98 [2024-10-13 04:35:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:39,705 INFO L225 Difference]: With dead ends: 193 [2024-10-13 04:35:39,705 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 04:35:39,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2024-10-13 04:35:39,707 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 181 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:39,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 434 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 04:35:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 04:35:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2024-10-13 04:35:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-13 04:35:39,720 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-13 04:35:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:39,721 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-13 04:35:39,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 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-10-13 04:35:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-13 04:35:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:35:39,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:39,722 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, 1] [2024-10-13 04:35:39,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 04:35:39,723 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:39,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash -750476140, now seen corresponding path program 1 times [2024-10-13 04:35:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79304369] [2024-10-13 04:35:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:47,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:47,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79304369] [2024-10-13 04:35:47,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79304369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:47,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:47,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 04:35:47,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772465507] [2024-10-13 04:35:47,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:47,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 04:35:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:47,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 04:35:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:35:47,727 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-10-13 04:35:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:50,789 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2024-10-13 04:35:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 04:35:50,790 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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 99 [2024-10-13 04:35:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:50,792 INFO L225 Difference]: With dead ends: 201 [2024-10-13 04:35:50,793 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 04:35:50,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=324, Invalid=798, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 04:35:50,794 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:50,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 371 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 04:35:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 04:35:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2024-10-13 04:35:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:35:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-10-13 04:35:50,812 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 99 [2024-10-13 04:35:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:50,814 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-10-13 04:35:50,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-10-13 04:35:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-10-13 04:35:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:35:50,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:50,816 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, 1] [2024-10-13 04:35:50,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:35:50,816 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1559822766, now seen corresponding path program 1 times [2024-10-13 04:35:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:35:50,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576900224] [2024-10-13 04:35:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:35:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:35:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:35:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:35:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:35:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:35:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:35:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:35:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:35:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:35:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:35:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:35:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:35:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:35:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:35:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:35:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:35:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:35:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576900224] [2024-10-13 04:35:59,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576900224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:59,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 04:35:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737329276] [2024-10-13 04:35:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:59,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 04:35:59,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:35:59,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 04:35:59,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:35:59,540 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-10-13 04:36:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:36:04,176 INFO L93 Difference]: Finished difference Result 195 states and 268 transitions. [2024-10-13 04:36:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:36:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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 99 [2024-10-13 04:36:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:36:04,178 INFO L225 Difference]: With dead ends: 195 [2024-10-13 04:36:04,178 INFO L226 Difference]: Without dead ends: 193 [2024-10-13 04:36:04,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=321, Invalid=735, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 04:36:04,179 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:36:04,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 388 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 04:36:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-13 04:36:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 145. [2024-10-13 04:36:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:36:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-10-13 04:36:04,192 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 99 [2024-10-13 04:36:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:36:04,193 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-10-13 04:36:04,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-10-13 04:36:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-10-13 04:36:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:36:04,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:36:04,194 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, 1] [2024-10-13 04:36:04,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 04:36:04,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:36:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:36:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2016179996, now seen corresponding path program 1 times [2024-10-13 04:36:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:36:04,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686871266] [2024-10-13 04:36:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:36:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:36:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:36:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:36:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:36:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:36:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:36:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:36:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:36:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:36:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:36:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:36:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:36:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:36:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:36:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:36:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:36:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:36:08,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:36:08,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686871266] [2024-10-13 04:36:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686871266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:36:08,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:36:08,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 04:36:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431112919] [2024-10-13 04:36:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:36:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 04:36:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:36:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 04:36:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:36:08,030 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-13 04:36:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:36:10,512 INFO L93 Difference]: Finished difference Result 186 states and 256 transitions. [2024-10-13 04:36:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:36:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 99 [2024-10-13 04:36:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:36:10,514 INFO L225 Difference]: With dead ends: 186 [2024-10-13 04:36:10,514 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 04:36:10,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2024-10-13 04:36:10,515 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 166 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:36:10,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 422 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 04:36:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 04:36:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 142. [2024-10-13 04:36:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 93 states have internal predecessors, (116), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:36:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 206 transitions. [2024-10-13 04:36:10,529 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 206 transitions. Word has length 99 [2024-10-13 04:36:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:36:10,531 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 206 transitions. [2024-10-13 04:36:10,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-13 04:36:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 206 transitions. [2024-10-13 04:36:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:36:10,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:36:10,533 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, 1] [2024-10-13 04:36:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 04:36:10,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:36:10,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:36:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -747320219, now seen corresponding path program 1 times [2024-10-13 04:36:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:36:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861041746] [2024-10-13 04:36:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:36:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:36:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:36:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:36:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:36:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:36:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:36:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:36:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:36:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:36:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:36:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:36:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:36:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:36:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:36:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:36:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:36:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:36:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:36:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:36:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861041746] [2024-10-13 04:36:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861041746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:36:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:36:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 04:36:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576126091] [2024-10-13 04:36:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:36:14,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 04:36:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:36:14,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 04:36:14,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:36:14,757 INFO L87 Difference]: Start difference. First operand 142 states and 206 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:36:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:36:18,102 INFO L93 Difference]: Finished difference Result 202 states and 274 transitions. [2024-10-13 04:36:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 04:36:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-10-13 04:36:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:36:18,104 INFO L225 Difference]: With dead ends: 202 [2024-10-13 04:36:18,104 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 04:36:18,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 04:36:18,106 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 199 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:36:18,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 367 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 04:36:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 04:36:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 148. [2024-10-13 04:36:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:36:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-10-13 04:36:18,118 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 99 [2024-10-13 04:36:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:36:18,118 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-10-13 04:36:18,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:36:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-10-13 04:36:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:36:18,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:36:18,120 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, 1] [2024-10-13 04:36:18,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 04:36:18,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:36:18,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:36:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1834724159, now seen corresponding path program 1 times [2024-10-13 04:36:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:36:18,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5603586] [2024-10-13 04:36:18,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:36:18,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:36:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat