./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_100-while_file-59.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_100-while_file-59.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 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:59:44,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:59:45,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:59:45,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:59:45,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:59:45,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:59:45,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:59:45,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:59:45,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:59:45,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:59:45,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:59:45,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:59:45,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:59:45,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:59:45,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:59:45,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:59:45,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:59:45,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:59:45,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:59:45,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:59:45,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:59:45,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:59:45,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:59:45,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:59:45,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:59:45,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:59:45,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:59:45,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:59:45,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:59:45,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:59:45,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:59:45,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:59:45,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:59:45,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:59:45,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:59:45,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:59:45,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:59:45,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:59:45,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:59:45,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:59:45,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:59:45,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:59:45,122 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 -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2024-10-13 03:59:45,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:59:45,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:59:45,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:59:45,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:59:45,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:59:45,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-10-13 03:59:46,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:59:47,202 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:59:47,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-10-13 03:59:47,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437119a25/6b886c23eec24f65ad1f6616a6bf77a9/FLAG6ce1aec72 [2024-10-13 03:59:47,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437119a25/6b886c23eec24f65ad1f6616a6bf77a9 [2024-10-13 03:59:47,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:59:47,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:59:47,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:59:47,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:59:47,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:59:47,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723b9133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47, skipping insertion in model container [2024-10-13 03:59:47,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:59:47,462 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_100-while_file-59.i[916,929] [2024-10-13 03:59:47,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:59:47,559 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:59:47,570 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_100-while_file-59.i[916,929] [2024-10-13 03:59:47,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:59:47,648 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:59:47,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47 WrapperNode [2024-10-13 03:59:47,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:59:47,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:59:47,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:59:47,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:59:47,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,762 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-10-13 03:59:47,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:59:47,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:59:47,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:59:47,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:59:47,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,862 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 03:59:47,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:59:47,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:59:47,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:59:47,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:59:47,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 03:59:47,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:59:47,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:59:47,955 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 03:59:47,958 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 03:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:59:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:59:48,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:59:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:59:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:59:48,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:59:48,089 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:59:48,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:59:48,706 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-13 03:59:48,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:59:48,765 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:59:48,767 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:59:48,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:48 BoogieIcfgContainer [2024-10-13 03:59:48,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:59:48,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:59:48,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:59:48,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:59:48,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:59:47" (1/3) ... [2024-10-13 03:59:48,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43df4798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:59:48, skipping insertion in model container [2024-10-13 03:59:48,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (2/3) ... [2024-10-13 03:59:48,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43df4798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:59:48, skipping insertion in model container [2024-10-13 03:59:48,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:48" (3/3) ... [2024-10-13 03:59:48,778 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-59.i [2024-10-13 03:59:48,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:59:48,796 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:59:48,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:59:48,878 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;@78c22aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:59:48,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:59:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 80 states have (on average 1.5625) internal successors, (125), 81 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 03:59:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 03:59:48,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:48,905 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:48,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 950854602, now seen corresponding path program 1 times [2024-10-13 03:59:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:48,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806986487] [2024-10-13 03:59:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806986487] [2024-10-13 03:59:49,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806986487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:49,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:59:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373910036] [2024-10-13 03:59:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:59:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:49,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:59:49,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:59:49,479 INFO L87 Difference]: Start difference. First operand has 104 states, 80 states have (on average 1.5625) internal successors, (125), 81 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 03:59:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:49,538 INFO L93 Difference]: Finished difference Result 205 states and 353 transitions. [2024-10-13 03:59:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:59:49,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 144 [2024-10-13 03:59:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:49,548 INFO L225 Difference]: With dead ends: 205 [2024-10-13 03:59:49,549 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 03:59:49,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:59:49,555 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:49,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:59:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 03:59:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 03:59:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 79 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 03:59:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2024-10-13 03:59:49,609 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 144 [2024-10-13 03:59:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 161 transitions. [2024-10-13 03:59:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 03:59:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions. [2024-10-13 03:59:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 03:59:49,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:49,620 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:49,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:59:49,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:49,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:49,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1979873596, now seen corresponding path program 1 times [2024-10-13 03:59:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371376911] [2024-10-13 03:59:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371376911] [2024-10-13 03:59:49,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371376911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:49,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:59:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965583522] [2024-10-13 03:59:49,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:49,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:59:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:59:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:59:49,994 INFO L87 Difference]: Start difference. First operand 102 states and 161 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:50,101 INFO L93 Difference]: Finished difference Result 301 states and 475 transitions. [2024-10-13 03:59:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:59:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-10-13 03:59:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:50,106 INFO L225 Difference]: With dead ends: 301 [2024-10-13 03:59:50,106 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 03:59:50,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:59:50,109 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 140 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:50,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 286 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:59:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 03:59:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-10-13 03:59:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.457516339869281) internal successors, (223), 153 states have internal predecessors, (223), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 03:59:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 307 transitions. [2024-10-13 03:59:50,154 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 307 transitions. Word has length 144 [2024-10-13 03:59:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:50,156 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 307 transitions. [2024-10-13 03:59:50,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 307 transitions. [2024-10-13 03:59:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 03:59:50,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:50,160 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:50,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:59:50,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:50,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1457022818, now seen corresponding path program 1 times [2024-10-13 03:59:50,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:50,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242517880] [2024-10-13 03:59:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:50,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242517880] [2024-10-13 03:59:50,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242517880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:50,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:50,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:59:50,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456345075] [2024-10-13 03:59:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:50,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:59:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:50,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:59:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:59:50,486 INFO L87 Difference]: Start difference. First operand 198 states and 307 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:50,553 INFO L93 Difference]: Finished difference Result 395 states and 613 transitions. [2024-10-13 03:59:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:59:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-10-13 03:59:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:50,556 INFO L225 Difference]: With dead ends: 395 [2024-10-13 03:59:50,556 INFO L226 Difference]: Without dead ends: 198 [2024-10-13 03:59:50,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 03:59:50,559 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 2 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:50,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 279 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:59:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-13 03:59:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-13 03:59:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 153 states have internal predecessors, (221), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 03:59:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 305 transitions. [2024-10-13 03:59:50,578 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 305 transitions. Word has length 145 [2024-10-13 03:59:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:50,580 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 305 transitions. [2024-10-13 03:59:50,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 305 transitions. [2024-10-13 03:59:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 03:59:50,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:50,584 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:50,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:59:50,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:50,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -314013048, now seen corresponding path program 1 times [2024-10-13 03:59:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:50,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235003909] [2024-10-13 03:59:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:50,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235003909] [2024-10-13 03:59:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235003909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:59:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417983259] [2024-10-13 03:59:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:59:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:59:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:59:51,138 INFO L87 Difference]: Start difference. First operand 198 states and 305 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:51,518 INFO L93 Difference]: Finished difference Result 505 states and 776 transitions. [2024-10-13 03:59:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:59:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-10-13 03:59:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:51,522 INFO L225 Difference]: With dead ends: 505 [2024-10-13 03:59:51,522 INFO L226 Difference]: Without dead ends: 308 [2024-10-13 03:59:51,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:59:51,526 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 113 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:51,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 483 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:59:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-13 03:59:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-10-13 03:59:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 238 states have (on average 1.4285714285714286) internal successors, (340), 238 states have internal predecessors, (340), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-13 03:59:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 466 transitions. [2024-10-13 03:59:51,573 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 466 transitions. Word has length 146 [2024-10-13 03:59:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:51,574 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 466 transitions. [2024-10-13 03:59:51,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 466 transitions. [2024-10-13 03:59:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 03:59:51,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:51,578 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:51,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:59:51,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:51,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash 348594893, now seen corresponding path program 1 times [2024-10-13 03:59:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:51,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235623295] [2024-10-13 03:59:51,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:51,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:51,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:51,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235623295] [2024-10-13 03:59:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235623295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:51,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:59:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588935799] [2024-10-13 03:59:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:51,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:59:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:59:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:59:51,868 INFO L87 Difference]: Start difference. First operand 305 states and 466 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:51,917 INFO L93 Difference]: Finished difference Result 615 states and 940 transitions. [2024-10-13 03:59:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:59:51,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-10-13 03:59:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:51,922 INFO L225 Difference]: With dead ends: 615 [2024-10-13 03:59:51,922 INFO L226 Difference]: Without dead ends: 311 [2024-10-13 03:59:51,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:59:51,925 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:51,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:59:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-13 03:59:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-13 03:59:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 244 states have (on average 1.4180327868852458) internal successors, (346), 244 states have internal predecessors, (346), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-13 03:59:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 472 transitions. [2024-10-13 03:59:51,959 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 472 transitions. Word has length 146 [2024-10-13 03:59:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 472 transitions. [2024-10-13 03:59:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2024-10-13 03:59:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 03:59:51,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:51,963 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:59:51,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash -460751733, now seen corresponding path program 1 times [2024-10-13 03:59:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568825656] [2024-10-13 03:59:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568825656] [2024-10-13 03:59:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568825656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:59:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938975269] [2024-10-13 03:59:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:59:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:59:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:59:53,901 INFO L87 Difference]: Start difference. First operand 311 states and 472 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:54,572 INFO L93 Difference]: Finished difference Result 817 states and 1237 transitions. [2024-10-13 03:59:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:59:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-10-13 03:59:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:54,576 INFO L225 Difference]: With dead ends: 817 [2024-10-13 03:59:54,577 INFO L226 Difference]: Without dead ends: 507 [2024-10-13 03:59:54,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:59:54,579 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 338 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:54,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 669 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:59:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-10-13 03:59:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 433. [2024-10-13 03:59:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 366 states have (on average 1.453551912568306) internal successors, (532), 366 states have internal predecessors, (532), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-13 03:59:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 658 transitions. [2024-10-13 03:59:54,614 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 658 transitions. Word has length 146 [2024-10-13 03:59:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:54,616 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 658 transitions. [2024-10-13 03:59:54,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 658 transitions. [2024-10-13 03:59:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 03:59:54,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:54,618 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:59:54,618 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1462476301, now seen corresponding path program 1 times [2024-10-13 03:59:54,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:54,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857657856] [2024-10-13 03:59:54,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857657856] [2024-10-13 03:59:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857657856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:59:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808703107] [2024-10-13 03:59:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:54,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:59:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:59:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:59:54,891 INFO L87 Difference]: Start difference. First operand 433 states and 658 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:55,086 INFO L93 Difference]: Finished difference Result 1348 states and 2036 transitions. [2024-10-13 03:59:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:59:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-10-13 03:59:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:55,093 INFO L225 Difference]: With dead ends: 1348 [2024-10-13 03:59:55,093 INFO L226 Difference]: Without dead ends: 916 [2024-10-13 03:59:55,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:59:55,097 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 213 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:55,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 536 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:59:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2024-10-13 03:59:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 741. [2024-10-13 03:59:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 608 states have (on average 1.430921052631579) internal successors, (870), 608 states have internal predecessors, (870), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-13 03:59:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1122 transitions. [2024-10-13 03:59:55,175 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1122 transitions. Word has length 146 [2024-10-13 03:59:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:55,175 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1122 transitions. [2024-10-13 03:59:55,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1122 transitions. [2024-10-13 03:59:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 03:59:55,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:55,178 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:55,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:59:55,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:55,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash -601541451, now seen corresponding path program 1 times [2024-10-13 03:59:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357432906] [2024-10-13 03:59:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:59:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:59:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:59:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:59:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:59:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:59:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:59:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:59:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:59:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:59:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:59:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:59:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:59:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:59:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:59:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:59:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:59:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:59:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:59:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:59:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:59:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:59:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:59:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:59:58,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:59:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357432906] [2024-10-13 03:59:58,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357432906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:59:58,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:59:58,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 03:59:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592071867] [2024-10-13 03:59:58,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:59:58,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:59:58,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:59:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:59:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:59:58,238 INFO L87 Difference]: Start difference. First operand 741 states and 1122 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:59:59,837 INFO L93 Difference]: Finished difference Result 1630 states and 2467 transitions. [2024-10-13 03:59:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:59:59,838 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 151 [2024-10-13 03:59:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:59:59,844 INFO L225 Difference]: With dead ends: 1630 [2024-10-13 03:59:59,844 INFO L226 Difference]: Without dead ends: 890 [2024-10-13 03:59:59,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:59:59,847 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 403 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:59:59,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1014 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 03:59:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-13 03:59:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 799. [2024-10-13 03:59:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 666 states have (on average 1.406906906906907) internal successors, (937), 666 states have internal predecessors, (937), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-13 03:59:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1189 transitions. [2024-10-13 03:59:59,943 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1189 transitions. Word has length 151 [2024-10-13 03:59:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:59:59,944 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1189 transitions. [2024-10-13 03:59:59,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:59:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1189 transitions. [2024-10-13 03:59:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 03:59:59,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:59:59,947 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:59:59,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:59:59,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:59:59,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:59:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2105077943, now seen corresponding path program 1 times [2024-10-13 03:59:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:59:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569146603] [2024-10-13 03:59:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:59:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569146603] [2024-10-13 04:00:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569146603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:00:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790382375] [2024-10-13 04:00:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:00,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:00:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:00:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:00:00,775 INFO L87 Difference]: Start difference. First operand 799 states and 1189 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:00:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:02,574 INFO L93 Difference]: Finished difference Result 3594 states and 5260 transitions. [2024-10-13 04:00:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:00:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 151 [2024-10-13 04:00:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:02,590 INFO L225 Difference]: With dead ends: 3594 [2024-10-13 04:00:02,591 INFO L226 Difference]: Without dead ends: 2796 [2024-10-13 04:00:02,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-10-13 04:00:02,595 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1327 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:02,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 839 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 04:00:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2024-10-13 04:00:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2217. [2024-10-13 04:00:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1934 states have (on average 1.4224405377456049) internal successors, (2751), 1940 states have internal predecessors, (2751), 264 states have call successors, (264), 18 states have call predecessors, (264), 18 states have return successors, (264), 258 states have call predecessors, (264), 264 states have call successors, (264) [2024-10-13 04:00:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3279 transitions. [2024-10-13 04:00:02,760 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3279 transitions. Word has length 151 [2024-10-13 04:00:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:02,762 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 3279 transitions. [2024-10-13 04:00:02,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:00:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3279 transitions. [2024-10-13 04:00:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 04:00:02,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:02,765 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:02,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 04:00:02,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:02,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash -658313306, now seen corresponding path program 1 times [2024-10-13 04:00:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:02,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914820871] [2024-10-13 04:00:02,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914820871] [2024-10-13 04:00:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914820871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:00:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355052028] [2024-10-13 04:00:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:02,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:00:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:00:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:00:02,881 INFO L87 Difference]: Start difference. First operand 2217 states and 3279 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:03,156 INFO L93 Difference]: Finished difference Result 6105 states and 9066 transitions. [2024-10-13 04:00:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:00:03,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2024-10-13 04:00:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:03,178 INFO L225 Difference]: With dead ends: 6105 [2024-10-13 04:00:03,179 INFO L226 Difference]: Without dead ends: 3889 [2024-10-13 04:00:03,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:00:03,186 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 114 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:03,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 281 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:00:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2024-10-13 04:00:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3215. [2024-10-13 04:00:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 2932 states have (on average 1.4051841746248295) internal successors, (4120), 2938 states have internal predecessors, (4120), 264 states have call successors, (264), 18 states have call predecessors, (264), 18 states have return successors, (264), 258 states have call predecessors, (264), 264 states have call successors, (264) [2024-10-13 04:00:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4648 transitions. [2024-10-13 04:00:03,393 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4648 transitions. Word has length 152 [2024-10-13 04:00:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:03,393 INFO L471 AbstractCegarLoop]: Abstraction has 3215 states and 4648 transitions. [2024-10-13 04:00:03,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4648 transitions. [2024-10-13 04:00:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 04:00:03,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:03,398 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:00:03,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash -582878251, now seen corresponding path program 1 times [2024-10-13 04:00:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756061121] [2024-10-13 04:00:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756061121] [2024-10-13 04:00:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756061121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:00:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379476707] [2024-10-13 04:00:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:03,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:00:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:00:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:00:03,525 INFO L87 Difference]: Start difference. First operand 3215 states and 4648 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:03,839 INFO L93 Difference]: Finished difference Result 7446 states and 10805 transitions. [2024-10-13 04:00:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:00:03,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2024-10-13 04:00:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:03,861 INFO L225 Difference]: With dead ends: 7446 [2024-10-13 04:00:03,861 INFO L226 Difference]: Without dead ends: 4232 [2024-10-13 04:00:03,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:00:03,870 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:03,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 485 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:00:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4232 states. [2024-10-13 04:00:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4232 to 3698. [2024-10-13 04:00:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3277 states have (on average 1.3887702166615807) internal successors, (4551), 3289 states have internal predecessors, (4551), 390 states have call successors, (390), 30 states have call predecessors, (390), 30 states have return successors, (390), 378 states have call predecessors, (390), 390 states have call successors, (390) [2024-10-13 04:00:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5331 transitions. [2024-10-13 04:00:04,223 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5331 transitions. Word has length 152 [2024-10-13 04:00:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:04,224 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 5331 transitions. [2024-10-13 04:00:04,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5331 transitions. [2024-10-13 04:00:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 04:00:04,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:04,230 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:04,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 04:00:04,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1355039693, now seen corresponding path program 1 times [2024-10-13 04:00:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:04,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281996449] [2024-10-13 04:00:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:04,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281996449] [2024-10-13 04:00:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281996449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:07,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 04:00:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144689820] [2024-10-13 04:00:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 04:00:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 04:00:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:00:07,743 INFO L87 Difference]: Start difference. First operand 3698 states and 5331 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:10,825 INFO L93 Difference]: Finished difference Result 7565 states and 10821 transitions. [2024-10-13 04:00:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:00:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2024-10-13 04:00:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:10,848 INFO L225 Difference]: With dead ends: 7565 [2024-10-13 04:00:10,848 INFO L226 Difference]: Without dead ends: 5019 [2024-10-13 04:00:10,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2024-10-13 04:00:10,856 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 832 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:10,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1288 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 04:00:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2024-10-13 04:00:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 3872. [2024-10-13 04:00:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3872 states, 3451 states have (on average 1.3865546218487395) internal successors, (4785), 3463 states have internal predecessors, (4785), 390 states have call successors, (390), 30 states have call predecessors, (390), 30 states have return successors, (390), 378 states have call predecessors, (390), 390 states have call successors, (390) [2024-10-13 04:00:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 5565 transitions. [2024-10-13 04:00:11,101 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 5565 transitions. Word has length 152 [2024-10-13 04:00:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:11,102 INFO L471 AbstractCegarLoop]: Abstraction has 3872 states and 5565 transitions. [2024-10-13 04:00:11,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 5565 transitions. [2024-10-13 04:00:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 04:00:11,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:11,107 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 04:00:11,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1351579701, now seen corresponding path program 1 times [2024-10-13 04:00:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277051192] [2024-10-13 04:00:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277051192] [2024-10-13 04:00:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277051192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:13,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 04:00:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288261491] [2024-10-13 04:00:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:13,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 04:00:13,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 04:00:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:00:13,999 INFO L87 Difference]: Start difference. First operand 3872 states and 5565 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:00:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:17,717 INFO L93 Difference]: Finished difference Result 6960 states and 9972 transitions. [2024-10-13 04:00:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:00:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-13 04:00:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:17,739 INFO L225 Difference]: With dead ends: 6960 [2024-10-13 04:00:17,740 INFO L226 Difference]: Without dead ends: 4240 [2024-10-13 04:00:17,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2024-10-13 04:00:17,749 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 906 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:17,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1334 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 04:00:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2024-10-13 04:00:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 3906. [2024-10-13 04:00:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 3485 states have (on average 1.3856527977044477) internal successors, (4829), 3497 states have internal predecessors, (4829), 390 states have call successors, (390), 30 states have call predecessors, (390), 30 states have return successors, (390), 378 states have call predecessors, (390), 390 states have call successors, (390) [2024-10-13 04:00:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 5609 transitions. [2024-10-13 04:00:18,008 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 5609 transitions. Word has length 152 [2024-10-13 04:00:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:18,009 INFO L471 AbstractCegarLoop]: Abstraction has 3906 states and 5609 transitions. [2024-10-13 04:00:18,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:00:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 5609 transitions. [2024-10-13 04:00:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 04:00:18,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:18,014 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:18,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 04:00:18,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:18,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1661153662, now seen corresponding path program 1 times [2024-10-13 04:00:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:18,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13204832] [2024-10-13 04:00:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13204832] [2024-10-13 04:00:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13204832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:00:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860512882] [2024-10-13 04:00:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:18,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:00:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:00:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:00:18,141 INFO L87 Difference]: Start difference. First operand 3906 states and 5609 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:18,604 INFO L93 Difference]: Finished difference Result 8668 states and 12446 transitions. [2024-10-13 04:00:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:00:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 153 [2024-10-13 04:00:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:18,636 INFO L225 Difference]: With dead ends: 8668 [2024-10-13 04:00:18,636 INFO L226 Difference]: Without dead ends: 4763 [2024-10-13 04:00:18,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:00:18,648 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 114 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:18,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 504 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:00:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2024-10-13 04:00:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4087. [2024-10-13 04:00:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4087 states, 3666 states have (on average 1.3772504091653028) internal successors, (5049), 3678 states have internal predecessors, (5049), 390 states have call successors, (390), 30 states have call predecessors, (390), 30 states have return successors, (390), 378 states have call predecessors, (390), 390 states have call successors, (390) [2024-10-13 04:00:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4087 states to 4087 states and 5829 transitions. [2024-10-13 04:00:18,920 INFO L78 Accepts]: Start accepts. Automaton has 4087 states and 5829 transitions. Word has length 153 [2024-10-13 04:00:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:18,922 INFO L471 AbstractCegarLoop]: Abstraction has 4087 states and 5829 transitions. [2024-10-13 04:00:18,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4087 states and 5829 transitions. [2024-10-13 04:00:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 04:00:18,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:18,928 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:18,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 04:00:18,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:18,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1781670270, now seen corresponding path program 1 times [2024-10-13 04:00:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853253495] [2024-10-13 04:00:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853253495] [2024-10-13 04:00:22,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853253495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:22,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:00:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490151573] [2024-10-13 04:00:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:00:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:00:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:00:22,074 INFO L87 Difference]: Start difference. First operand 4087 states and 5829 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:23,114 INFO L93 Difference]: Finished difference Result 7668 states and 10893 transitions. [2024-10-13 04:00:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:00:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 153 [2024-10-13 04:00:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:23,140 INFO L225 Difference]: With dead ends: 7668 [2024-10-13 04:00:23,141 INFO L226 Difference]: Without dead ends: 5122 [2024-10-13 04:00:23,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:00:23,148 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 263 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:23,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 405 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 04:00:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2024-10-13 04:00:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 4786. [2024-10-13 04:00:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4786 states, 4425 states have (on average 1.3850847457627118) internal successors, (6129), 4437 states have internal predecessors, (6129), 322 states have call successors, (322), 38 states have call predecessors, (322), 38 states have return successors, (322), 310 states have call predecessors, (322), 322 states have call successors, (322) [2024-10-13 04:00:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6773 transitions. [2024-10-13 04:00:23,412 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6773 transitions. Word has length 153 [2024-10-13 04:00:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6773 transitions. [2024-10-13 04:00:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6773 transitions. [2024-10-13 04:00:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 04:00:23,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:23,421 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 04:00:23,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 458223124, now seen corresponding path program 1 times [2024-10-13 04:00:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123668879] [2024-10-13 04:00:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123668879] [2024-10-13 04:00:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123668879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:24,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:24,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 04:00:24,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005514169] [2024-10-13 04:00:24,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:24,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 04:00:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 04:00:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:00:24,806 INFO L87 Difference]: Start difference. First operand 4786 states and 6773 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:26,229 INFO L93 Difference]: Finished difference Result 8646 states and 12199 transitions. [2024-10-13 04:00:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:00:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 153 [2024-10-13 04:00:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:26,243 INFO L225 Difference]: With dead ends: 8646 [2024-10-13 04:00:26,243 INFO L226 Difference]: Without dead ends: 5402 [2024-10-13 04:00:26,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-10-13 04:00:26,252 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 704 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:26,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 699 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:00:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2024-10-13 04:00:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4805. [2024-10-13 04:00:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 4444 states have (on average 1.383888388838884) internal successors, (6150), 4456 states have internal predecessors, (6150), 322 states have call successors, (322), 38 states have call predecessors, (322), 38 states have return successors, (322), 310 states have call predecessors, (322), 322 states have call successors, (322) [2024-10-13 04:00:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6794 transitions. [2024-10-13 04:00:26,638 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6794 transitions. Word has length 153 [2024-10-13 04:00:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:26,639 INFO L471 AbstractCegarLoop]: Abstraction has 4805 states and 6794 transitions. [2024-10-13 04:00:26,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6794 transitions. [2024-10-13 04:00:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 04:00:26,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:26,645 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:26,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 04:00:26,646 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1389825916, now seen corresponding path program 1 times [2024-10-13 04:00:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:26,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824686076] [2024-10-13 04:00:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:30,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824686076] [2024-10-13 04:00:30,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824686076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:30,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 04:00:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197726562] [2024-10-13 04:00:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:30,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 04:00:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 04:00:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:00:30,118 INFO L87 Difference]: Start difference. First operand 4805 states and 6794 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:31,595 INFO L93 Difference]: Finished difference Result 11238 states and 15761 transitions. [2024-10-13 04:00:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:00:31,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 04:00:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:31,626 INFO L225 Difference]: With dead ends: 11238 [2024-10-13 04:00:31,626 INFO L226 Difference]: Without dead ends: 11236 [2024-10-13 04:00:31,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:00:31,633 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 561 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:31,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 938 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:00:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2024-10-13 04:00:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 11152. [2024-10-13 04:00:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11152 states, 10421 states have (on average 1.378754438153728) internal successors, (14368), 10465 states have internal predecessors, (14368), 644 states have call successors, (644), 86 states have call predecessors, (644), 86 states have return successors, (644), 600 states have call predecessors, (644), 644 states have call successors, (644) [2024-10-13 04:00:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11152 states to 11152 states and 15656 transitions. [2024-10-13 04:00:32,208 INFO L78 Accepts]: Start accepts. Automaton has 11152 states and 15656 transitions. Word has length 154 [2024-10-13 04:00:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:32,209 INFO L471 AbstractCegarLoop]: Abstraction has 11152 states and 15656 transitions. [2024-10-13 04:00:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11152 states and 15656 transitions. [2024-10-13 04:00:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 04:00:32,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:32,217 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:32,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 04:00:32,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:32,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -725029762, now seen corresponding path program 1 times [2024-10-13 04:00:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:32,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918902812] [2024-10-13 04:00:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:32,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:32,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918902812] [2024-10-13 04:00:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918902812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:32,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:00:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441789513] [2024-10-13 04:00:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:32,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:00:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:00:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:00:32,428 INFO L87 Difference]: Start difference. First operand 11152 states and 15656 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:33,487 INFO L93 Difference]: Finished difference Result 23743 states and 33498 transitions. [2024-10-13 04:00:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:00:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 04:00:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:33,529 INFO L225 Difference]: With dead ends: 23743 [2024-10-13 04:00:33,530 INFO L226 Difference]: Without dead ends: 12512 [2024-10-13 04:00:33,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:00:33,554 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 313 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:33,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 463 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:00:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12512 states. [2024-10-13 04:00:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12512 to 8990. [2024-10-13 04:00:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8990 states, 8259 states have (on average 1.3488315776728417) internal successors, (11140), 8303 states have internal predecessors, (11140), 644 states have call successors, (644), 86 states have call predecessors, (644), 86 states have return successors, (644), 600 states have call predecessors, (644), 644 states have call successors, (644) [2024-10-13 04:00:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 12428 transitions. [2024-10-13 04:00:34,154 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 12428 transitions. Word has length 154 [2024-10-13 04:00:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:34,155 INFO L471 AbstractCegarLoop]: Abstraction has 8990 states and 12428 transitions. [2024-10-13 04:00:34,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 12428 transitions. [2024-10-13 04:00:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 04:00:34,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:34,161 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 04:00:34,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2099081710, now seen corresponding path program 1 times [2024-10-13 04:00:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4545959] [2024-10-13 04:00:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:35,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4545959] [2024-10-13 04:00:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4545959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:35,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:35,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 04:00:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125730723] [2024-10-13 04:00:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:35,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 04:00:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 04:00:35,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:00:35,442 INFO L87 Difference]: Start difference. First operand 8990 states and 12428 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:37,460 INFO L93 Difference]: Finished difference Result 17177 states and 23519 transitions. [2024-10-13 04:00:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 04:00:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 04:00:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:37,487 INFO L225 Difference]: With dead ends: 17177 [2024-10-13 04:00:37,487 INFO L226 Difference]: Without dead ends: 10778 [2024-10-13 04:00:37,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-10-13 04:00:37,504 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 539 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:37,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 916 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 04:00:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10778 states. [2024-10-13 04:00:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10778 to 8823. [2024-10-13 04:00:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8823 states, 8092 states have (on average 1.347132970835393) internal successors, (10901), 8136 states have internal predecessors, (10901), 644 states have call successors, (644), 86 states have call predecessors, (644), 86 states have return successors, (644), 600 states have call predecessors, (644), 644 states have call successors, (644) [2024-10-13 04:00:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 12189 transitions. [2024-10-13 04:00:38,040 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 12189 transitions. Word has length 154 [2024-10-13 04:00:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:38,041 INFO L471 AbstractCegarLoop]: Abstraction has 8823 states and 12189 transitions. [2024-10-13 04:00:38,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 12189 transitions. [2024-10-13 04:00:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 04:00:38,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:38,047 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 04:00:38,048 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:38,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 39943575, now seen corresponding path program 1 times [2024-10-13 04:00:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:38,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994682246] [2024-10-13 04:00:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:39,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:39,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994682246] [2024-10-13 04:00:39,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994682246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:39,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:39,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 04:00:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234586454] [2024-10-13 04:00:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:39,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:00:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:39,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:00:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:00:39,731 INFO L87 Difference]: Start difference. First operand 8823 states and 12189 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:40,847 INFO L93 Difference]: Finished difference Result 13718 states and 18904 transitions. [2024-10-13 04:00:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 04:00:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 04:00:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:40,874 INFO L225 Difference]: With dead ends: 13718 [2024-10-13 04:00:40,875 INFO L226 Difference]: Without dead ends: 11122 [2024-10-13 04:00:40,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:00:40,886 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 393 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:40,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 666 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:00:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11122 states. [2024-10-13 04:00:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11122 to 9007. [2024-10-13 04:00:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9007 states, 8276 states have (on average 1.3487191880135332) internal successors, (11162), 8320 states have internal predecessors, (11162), 644 states have call successors, (644), 86 states have call predecessors, (644), 86 states have return successors, (644), 600 states have call predecessors, (644), 644 states have call successors, (644) [2024-10-13 04:00:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9007 states to 9007 states and 12450 transitions. [2024-10-13 04:00:41,413 INFO L78 Accepts]: Start accepts. Automaton has 9007 states and 12450 transitions. Word has length 154 [2024-10-13 04:00:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:41,414 INFO L471 AbstractCegarLoop]: Abstraction has 9007 states and 12450 transitions. [2024-10-13 04:00:41,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9007 states and 12450 transitions. [2024-10-13 04:00:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 04:00:41,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:41,418 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:41,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 04:00:41,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:41,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1954201131, now seen corresponding path program 1 times [2024-10-13 04:00:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028351584] [2024-10-13 04:00:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028351584] [2024-10-13 04:00:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028351584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:42,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 04:00:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401883799] [2024-10-13 04:00:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:00:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:00:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:00:42,547 INFO L87 Difference]: Start difference. First operand 9007 states and 12450 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:43,378 INFO L93 Difference]: Finished difference Result 16673 states and 22995 transitions. [2024-10-13 04:00:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 04:00:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 04:00:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:43,409 INFO L225 Difference]: With dead ends: 16673 [2024-10-13 04:00:43,409 INFO L226 Difference]: Without dead ends: 10257 [2024-10-13 04:00:43,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:00:43,424 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 305 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:43,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 608 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:00:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10257 states. [2024-10-13 04:00:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10257 to 8959. [2024-10-13 04:00:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8959 states, 8228 states have (on average 1.3472289742343218) internal successors, (11085), 8272 states have internal predecessors, (11085), 644 states have call successors, (644), 86 states have call predecessors, (644), 86 states have return successors, (644), 600 states have call predecessors, (644), 644 states have call successors, (644) [2024-10-13 04:00:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 12373 transitions. [2024-10-13 04:00:43,981 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 12373 transitions. Word has length 154 [2024-10-13 04:00:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:43,982 INFO L471 AbstractCegarLoop]: Abstraction has 8959 states and 12373 transitions. [2024-10-13 04:00:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:00:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 12373 transitions. [2024-10-13 04:00:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 04:00:43,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:43,987 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:43,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 04:00:43,987 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash 340037383, now seen corresponding path program 1 times [2024-10-13 04:00:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196608880] [2024-10-13 04:00:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:00:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:00:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:00:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:00:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:00:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:00:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:00:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:00:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:00:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:00:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:00:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:00:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:00:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:00:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:00:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:00:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:00:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:00:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:00:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:00:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:00:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:00:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:00:44,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:00:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196608880] [2024-10-13 04:00:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196608880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:00:44,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:00:44,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:00:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801212570] [2024-10-13 04:00:44,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:00:44,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:00:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:00:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:00:44,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:00:44,552 INFO L87 Difference]: Start difference. First operand 8959 states and 12373 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:00:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:00:45,404 INFO L93 Difference]: Finished difference Result 18373 states and 25351 transitions. [2024-10-13 04:00:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:00:45,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2024-10-13 04:00:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:00:45,429 INFO L225 Difference]: With dead ends: 18373 [2024-10-13 04:00:45,430 INFO L226 Difference]: Without dead ends: 9415 [2024-10-13 04:00:45,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:00:45,445 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 614 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:00:45,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 484 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:00:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9415 states. [2024-10-13 04:00:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9415 to 8959. [2024-10-13 04:00:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8959 states, 8228 states have (on average 1.3462566844919786) internal successors, (11077), 8272 states have internal predecessors, (11077), 644 states have call successors, (644), 86 states have call predecessors, (644), 86 states have return successors, (644), 600 states have call predecessors, (644), 644 states have call successors, (644) [2024-10-13 04:00:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 12365 transitions. [2024-10-13 04:00:46,024 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 12365 transitions. Word has length 155 [2024-10-13 04:00:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:00:46,024 INFO L471 AbstractCegarLoop]: Abstraction has 8959 states and 12365 transitions. [2024-10-13 04:00:46,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:00:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 12365 transitions. [2024-10-13 04:00:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 04:00:46,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:00:46,029 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:00:46,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 04:00:46,030 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:00:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:00:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 206023877, now seen corresponding path program 1 times [2024-10-13 04:00:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:00:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968619157] [2024-10-13 04:00:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:00:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:00:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat