./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_fillercode_fillercodestructure_filler-ps-co_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59727828023891546cc5a25cf7f297a1b2c37fd03b88eda6114da55f7e3ce778 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:09:39,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:09:39,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:09:39,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:09:39,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:09:39,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:09:39,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:09:39,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:09:39,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:09:39,154 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:09:39,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:09:39,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:09:39,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:09:39,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:09:39,157 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:09:39,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:09:39,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:09:39,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:09:39,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:09:39,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:09:39,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:09:39,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:09:39,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:09:39,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:09:39,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:09:39,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:09:39,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:09:39,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:09:39,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:09:39,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:09:39,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:09:39,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:09:39,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:09:39,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:09:39,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:09:39,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:09:39,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:09:39,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:09:39,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:09:39,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:09:39,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:09:39,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:09:39,169 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 -> 59727828023891546cc5a25cf7f297a1b2c37fd03b88eda6114da55f7e3ce778 [2024-10-13 03:09:39,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:09:39,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:09:39,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:09:39,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:09:39,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:09:39,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2024-10-13 03:09:40,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:09:41,069 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:09:41,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2024-10-13 03:09:41,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be9c44cb/ee4c8581552b4649950345faf11a9346/FLAG9e64ad622 [2024-10-13 03:09:41,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be9c44cb/ee4c8581552b4649950345faf11a9346 [2024-10-13 03:09:41,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:09:41,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:09:41,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:09:41,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:09:41,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:09:41,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd71ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41, skipping insertion in model container [2024-10-13 03:09:41,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:09:41,324 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_fillercode_fillercodestructure_filler-ps-co_file-86.i[919,932] [2024-10-13 03:09:41,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:09:41,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:09:41,467 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_fillercode_fillercodestructure_filler-ps-co_file-86.i[919,932] [2024-10-13 03:09:41,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:09:41,527 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:09:41,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41 WrapperNode [2024-10-13 03:09:41,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:09:41,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:09:41,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:09:41,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:09:41,536 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:09:41" (1/1) ... [2024-10-13 03:09:41,558 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:09:41" (1/1) ... [2024-10-13 03:09:41,602 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-10-13 03:09:41,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:09:41,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:09:41,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:09:41,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:09:41,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,647 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:09:41,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:09:41,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:09:41,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:09:41,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:09:41,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (1/1) ... [2024-10-13 03:09:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:09:41,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:09:41,727 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:09:41,733 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:09:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:09:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:09:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:09:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:09:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:09:41,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:09:41,929 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:09:41,933 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:09:42,426 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 03:09:42,427 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:09:42,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:09:42,470 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:09:42,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:09:42 BoogieIcfgContainer [2024-10-13 03:09:42,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:09:42,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:09:42,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:09:42,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:09:42,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:09:41" (1/3) ... [2024-10-13 03:09:42,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573f39be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:09:42, skipping insertion in model container [2024-10-13 03:09:42,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:09:41" (2/3) ... [2024-10-13 03:09:42,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573f39be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:09:42, skipping insertion in model container [2024-10-13 03:09:42,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:09:42" (3/3) ... [2024-10-13 03:09:42,483 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2024-10-13 03:09:42,497 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:09:42,497 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:09:42,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:09:42,572 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;@67648a51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:09:42,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:09:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 62 states have (on average 1.532258064516129) internal successors, (95), 63 states have internal predecessors, (95), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:09:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:09:42,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:42,595 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:42,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:42,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1027232776, now seen corresponding path program 1 times [2024-10-13 03:09:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430852131] [2024-10-13 03:09:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430852131] [2024-10-13 03:09:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430852131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:09:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813058524] [2024-10-13 03:09:43,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:43,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:09:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:09:43,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:09:43,317 INFO L87 Difference]: Start difference. First operand has 92 states, 62 states have (on average 1.532258064516129) internal successors, (95), 63 states have internal predecessors, (95), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:09:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:43,367 INFO L93 Difference]: Finished difference Result 181 states and 323 transitions. [2024-10-13 03:09:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:09:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2024-10-13 03:09:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:43,385 INFO L225 Difference]: With dead ends: 181 [2024-10-13 03:09:43,386 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 03:09:43,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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:09:43,395 INFO L432 NwaCegarLoop]: 140 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, 140 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:09:43,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:09:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 03:09:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 03:09:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 61 states have internal predecessors, (89), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:09:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2024-10-13 03:09:43,446 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 143 transitions. Word has length 171 [2024-10-13 03:09:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:43,449 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 143 transitions. [2024-10-13 03:09:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:09:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 143 transitions. [2024-10-13 03:09:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:09:43,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:43,453 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:09:43,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -392632714, now seen corresponding path program 1 times [2024-10-13 03:09:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551975412] [2024-10-13 03:09:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551975412] [2024-10-13 03:09:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551975412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:43,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:09:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104117425] [2024-10-13 03:09:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:43,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:09:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:09:43,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:09:43,869 INFO L87 Difference]: Start difference. First operand 90 states and 143 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:43,918 INFO L93 Difference]: Finished difference Result 180 states and 287 transitions. [2024-10-13 03:09:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:09:43,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:09:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:43,921 INFO L225 Difference]: With dead ends: 180 [2024-10-13 03:09:43,921 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 03:09:43,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:09:43,923 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:09:43,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:09:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 03:09:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 03:09:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:09:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2024-10-13 03:09:43,936 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 171 [2024-10-13 03:09:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:43,938 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2024-10-13 03:09:43,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2024-10-13 03:09:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:09:43,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:43,941 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:43,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:09:43,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1980980616, now seen corresponding path program 1 times [2024-10-13 03:09:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503775883] [2024-10-13 03:09:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503775883] [2024-10-13 03:09:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503775883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:44,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:44,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:09:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346180295] [2024-10-13 03:09:44,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:44,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:09:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:09:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:09:44,418 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:44,724 INFO L93 Difference]: Finished difference Result 272 states and 431 transitions. [2024-10-13 03:09:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:09:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:09:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:44,729 INFO L225 Difference]: With dead ends: 272 [2024-10-13 03:09:44,731 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 03:09:44,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:09:44,736 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:09:44,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 462 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:09:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 03:09:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2024-10-13 03:09:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 106 states have internal predecessors, (150), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 03:09:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 258 transitions. [2024-10-13 03:09:44,779 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 258 transitions. Word has length 171 [2024-10-13 03:09:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:44,780 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 258 transitions. [2024-10-13 03:09:44,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 258 transitions. [2024-10-13 03:09:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:09:44,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:44,783 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:09:44,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1727180666, now seen corresponding path program 1 times [2024-10-13 03:09:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:44,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397376669] [2024-10-13 03:09:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397376669] [2024-10-13 03:09:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397376669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:09:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592343636] [2024-10-13 03:09:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:09:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:09:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:09:45,127 INFO L87 Difference]: Start difference. First operand 163 states and 258 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:45,171 INFO L93 Difference]: Finished difference Result 369 states and 585 transitions. [2024-10-13 03:09:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:09:45,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:09:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:45,176 INFO L225 Difference]: With dead ends: 369 [2024-10-13 03:09:45,176 INFO L226 Difference]: Without dead ends: 253 [2024-10-13 03:09:45,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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:09:45,185 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 99 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:09:45,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:09:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-13 03:09:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2024-10-13 03:09:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 166 states have internal predecessors, (236), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-13 03:09:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 398 transitions. [2024-10-13 03:09:45,233 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 398 transitions. Word has length 171 [2024-10-13 03:09:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 398 transitions. [2024-10-13 03:09:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 398 transitions. [2024-10-13 03:09:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:09:45,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:45,238 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:09:45,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2145084804, now seen corresponding path program 1 times [2024-10-13 03:09:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82826773] [2024-10-13 03:09:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82826773] [2024-10-13 03:09:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82826773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:52,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:52,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 03:09:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906791479] [2024-10-13 03:09:52,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:52,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 03:09:52,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 03:09:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:09:52,719 INFO L87 Difference]: Start difference. First operand 251 states and 398 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:55,608 INFO L93 Difference]: Finished difference Result 416 states and 647 transitions. [2024-10-13 03:09:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 03:09:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:09:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:55,619 INFO L225 Difference]: With dead ends: 416 [2024-10-13 03:09:55,619 INFO L226 Difference]: Without dead ends: 326 [2024-10-13 03:09:55,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2024-10-13 03:09:55,621 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 299 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:09:55,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 794 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 03:09:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-13 03:09:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2024-10-13 03:09:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 181 states have (on average 1.419889502762431) internal successors, (257), 181 states have internal predecessors, (257), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-13 03:09:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 419 transitions. [2024-10-13 03:09:55,667 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 419 transitions. Word has length 171 [2024-10-13 03:09:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:55,668 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 419 transitions. [2024-10-13 03:09:55,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 419 transitions. [2024-10-13 03:09:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 03:09:55,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:55,670 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:09:55,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1756855482, now seen corresponding path program 1 times [2024-10-13 03:09:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:55,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277170343] [2024-10-13 03:09:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:55,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277170343] [2024-10-13 03:09:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277170343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:09:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529911471] [2024-10-13 03:09:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:09:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:09:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:09:55,836 INFO L87 Difference]: Start difference. First operand 266 states and 419 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:55,894 INFO L93 Difference]: Finished difference Result 534 states and 846 transitions. [2024-10-13 03:09:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:09:55,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 03:09:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:55,899 INFO L225 Difference]: With dead ends: 534 [2024-10-13 03:09:55,900 INFO L226 Difference]: Without dead ends: 356 [2024-10-13 03:09:55,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:09:55,903 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:09:55,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 282 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:09:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-13 03:09:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2024-10-13 03:09:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 241 states have (on average 1.4066390041493777) internal successors, (339), 241 states have internal predecessors, (339), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:09:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 555 transitions. [2024-10-13 03:09:55,938 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 555 transitions. Word has length 171 [2024-10-13 03:09:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:55,939 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 555 transitions. [2024-10-13 03:09:55,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 555 transitions. [2024-10-13 03:09:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 03:09:55,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:55,941 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:09:55,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:55,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash -418093760, now seen corresponding path program 1 times [2024-10-13 03:09:55,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:55,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458610444] [2024-10-13 03:09:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:09:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:09:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:09:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:09:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:09:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:09:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:09:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:09:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:09:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:09:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:09:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:09:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:09:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:09:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:09:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:09:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:09:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:09:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:09:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:09:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:09:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:09:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:09:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:09:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:09:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:09:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:09:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:09:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:09:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:09:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458610444] [2024-10-13 03:09:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458610444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:09:56,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:09:56,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:09:56,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458471041] [2024-10-13 03:09:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:09:56,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:09:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:09:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:09:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:09:56,289 INFO L87 Difference]: Start difference. First operand 354 states and 555 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:09:56,333 INFO L93 Difference]: Finished difference Result 636 states and 996 transitions. [2024-10-13 03:09:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:09:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-13 03:09:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:09:56,338 INFO L225 Difference]: With dead ends: 636 [2024-10-13 03:09:56,338 INFO L226 Difference]: Without dead ends: 367 [2024-10-13 03:09:56,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:09:56,340 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:09:56,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 264 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:09:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-13 03:09:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2024-10-13 03:09:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 241 states have (on average 1.3900414937759336) internal successors, (335), 241 states have internal predecessors, (335), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:09:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 551 transitions. [2024-10-13 03:09:56,371 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 551 transitions. Word has length 172 [2024-10-13 03:09:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:09:56,372 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 551 transitions. [2024-10-13 03:09:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:09:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 551 transitions. [2024-10-13 03:09:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 03:09:56,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:09:56,388 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:56,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:09:56,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:09:56,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:09:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash -360835458, now seen corresponding path program 1 times [2024-10-13 03:09:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:09:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157382940] [2024-10-13 03:09:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:09:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:09:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157382940] [2024-10-13 03:10:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157382940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:02,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:10:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336075091] [2024-10-13 03:10:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:02,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:10:02,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:10:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:10:02,153 INFO L87 Difference]: Start difference. First operand 354 states and 551 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:05,356 INFO L93 Difference]: Finished difference Result 431 states and 645 transitions. [2024-10-13 03:10:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 03:10:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-13 03:10:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:05,361 INFO L225 Difference]: With dead ends: 431 [2024-10-13 03:10:05,361 INFO L226 Difference]: Without dead ends: 429 [2024-10-13 03:10:05,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 03:10:05,366 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 374 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:05,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 646 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 03:10:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-13 03:10:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 352. [2024-10-13 03:10:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 239 states have (on average 1.389121338912134) internal successors, (332), 239 states have internal predecessors, (332), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 548 transitions. [2024-10-13 03:10:05,402 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 548 transitions. Word has length 172 [2024-10-13 03:10:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:05,402 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 548 transitions. [2024-10-13 03:10:05,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 548 transitions. [2024-10-13 03:10:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 03:10:05,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:05,405 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:10:05,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:05,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2073817958, now seen corresponding path program 1 times [2024-10-13 03:10:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683636039] [2024-10-13 03:10:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683636039] [2024-10-13 03:10:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683636039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 03:10:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719465806] [2024-10-13 03:10:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:08,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 03:10:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 03:10:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:10:08,591 INFO L87 Difference]: Start difference. First operand 352 states and 548 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:09,610 INFO L93 Difference]: Finished difference Result 667 states and 1023 transitions. [2024-10-13 03:10:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 03:10:09,611 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-13 03:10:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:09,616 INFO L225 Difference]: With dead ends: 667 [2024-10-13 03:10:09,616 INFO L226 Difference]: Without dead ends: 401 [2024-10-13 03:10:09,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-10-13 03:10:09,619 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 260 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:09,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 882 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 03:10:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-13 03:10:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 356. [2024-10-13 03:10:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 243 states have (on average 1.3868312757201646) internal successors, (337), 243 states have internal predecessors, (337), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 553 transitions. [2024-10-13 03:10:09,649 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 553 transitions. Word has length 172 [2024-10-13 03:10:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:09,649 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 553 transitions. [2024-10-13 03:10:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 553 transitions. [2024-10-13 03:10:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 03:10:09,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:09,653 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:10:09,654 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:09,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2037729983, now seen corresponding path program 1 times [2024-10-13 03:10:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230212577] [2024-10-13 03:10:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230212577] [2024-10-13 03:10:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230212577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:14,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:14,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:10:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710393628] [2024-10-13 03:10:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:14,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:10:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:10:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:10:14,294 INFO L87 Difference]: Start difference. First operand 356 states and 553 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:18,577 INFO L93 Difference]: Finished difference Result 420 states and 626 transitions. [2024-10-13 03:10:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 03:10:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-13 03:10:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:18,581 INFO L225 Difference]: With dead ends: 420 [2024-10-13 03:10:18,581 INFO L226 Difference]: Without dead ends: 418 [2024-10-13 03:10:18,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2024-10-13 03:10:18,583 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 346 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:18,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 635 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 03:10:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-13 03:10:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 365. [2024-10-13 03:10:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 252 states have (on average 1.3849206349206349) internal successors, (349), 252 states have internal predecessors, (349), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2024-10-13 03:10:18,618 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 565 transitions. Word has length 172 [2024-10-13 03:10:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:18,619 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 565 transitions. [2024-10-13 03:10:18,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 565 transitions. [2024-10-13 03:10:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 03:10:18,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:18,621 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:18,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:10:18,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:18,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1447890687, now seen corresponding path program 1 times [2024-10-13 03:10:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71761628] [2024-10-13 03:10:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71761628] [2024-10-13 03:10:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71761628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:22,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:22,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 03:10:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043506532] [2024-10-13 03:10:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:22,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 03:10:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:22,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 03:10:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:10:22,656 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:10:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:25,371 INFO L93 Difference]: Finished difference Result 414 states and 620 transitions. [2024-10-13 03:10:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 03:10:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2024-10-13 03:10:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:25,375 INFO L225 Difference]: With dead ends: 414 [2024-10-13 03:10:25,375 INFO L226 Difference]: Without dead ends: 412 [2024-10-13 03:10:25,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2024-10-13 03:10:25,376 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 360 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:25,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 718 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 03:10:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-13 03:10:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 365. [2024-10-13 03:10:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 252 states have (on average 1.3849206349206349) internal successors, (349), 252 states have internal predecessors, (349), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2024-10-13 03:10:25,400 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 565 transitions. Word has length 172 [2024-10-13 03:10:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:25,401 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 565 transitions. [2024-10-13 03:10:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:10:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 565 transitions. [2024-10-13 03:10:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 03:10:25,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:25,403 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 03:10:25,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:25,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1698304216, now seen corresponding path program 1 times [2024-10-13 03:10:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:25,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780483545] [2024-10-13 03:10:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780483545] [2024-10-13 03:10:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780483545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 03:10:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210604292] [2024-10-13 03:10:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:28,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 03:10:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 03:10:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:10:28,563 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:10:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:29,797 INFO L93 Difference]: Finished difference Result 407 states and 611 transitions. [2024-10-13 03:10:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 03:10:29,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 173 [2024-10-13 03:10:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:29,801 INFO L225 Difference]: With dead ends: 407 [2024-10-13 03:10:29,801 INFO L226 Difference]: Without dead ends: 405 [2024-10-13 03:10:29,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 03:10:29,803 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 261 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:29,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 978 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:10:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-13 03:10:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 362. [2024-10-13 03:10:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 249 states have (on average 1.3855421686746987) internal successors, (345), 249 states have internal predecessors, (345), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 561 transitions. [2024-10-13 03:10:29,831 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 561 transitions. Word has length 173 [2024-10-13 03:10:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:29,832 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 561 transitions. [2024-10-13 03:10:29,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:10:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 561 transitions. [2024-10-13 03:10:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 03:10:29,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:29,833 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:29,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 03:10:29,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:29,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1327803303, now seen corresponding path program 1 times [2024-10-13 03:10:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993588843] [2024-10-13 03:10:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:33,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993588843] [2024-10-13 03:10:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993588843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:10:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542054987] [2024-10-13 03:10:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:33,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:10:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:33,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:10:33,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:10:33,938 INFO L87 Difference]: Start difference. First operand 362 states and 561 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:37,877 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2024-10-13 03:10:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 03:10:37,877 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-10-13 03:10:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:37,880 INFO L225 Difference]: With dead ends: 421 [2024-10-13 03:10:37,880 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 03:10:37,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=348, Invalid=842, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 03:10:37,882 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 278 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:37,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 810 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 03:10:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 03:10:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 365. [2024-10-13 03:10:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 252 states have (on average 1.3849206349206349) internal successors, (349), 252 states have internal predecessors, (349), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2024-10-13 03:10:37,908 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 565 transitions. Word has length 173 [2024-10-13 03:10:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:37,908 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 565 transitions. [2024-10-13 03:10:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 565 transitions. [2024-10-13 03:10:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 03:10:37,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:37,909 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:37,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 03:10:37,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1254241075, now seen corresponding path program 1 times [2024-10-13 03:10:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984040805] [2024-10-13 03:10:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:10:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:10:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:10:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:10:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:10:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:10:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:10:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:10:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:10:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:10:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:10:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:10:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:10:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:10:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:10:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:10:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:10:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:10:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:10:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:10:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:10:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:10:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:10:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:10:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:10:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:10:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:10:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:10:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:10:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:10:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984040805] [2024-10-13 03:10:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984040805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:10:44,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:10:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 03:10:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777318901] [2024-10-13 03:10:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:10:44,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 03:10:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:10:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 03:10:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:10:44,238 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:10:51,069 INFO L93 Difference]: Finished difference Result 417 states and 623 transitions. [2024-10-13 03:10:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 03:10:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-10-13 03:10:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:10:51,075 INFO L225 Difference]: With dead ends: 417 [2024-10-13 03:10:51,076 INFO L226 Difference]: Without dead ends: 415 [2024-10-13 03:10:51,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 03:10:51,078 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 347 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:10:51,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 751 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 03:10:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-13 03:10:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 368. [2024-10-13 03:10:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 255 states have (on average 1.384313725490196) internal successors, (353), 255 states have internal predecessors, (353), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:10:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 569 transitions. [2024-10-13 03:10:51,105 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 569 transitions. Word has length 173 [2024-10-13 03:10:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:10:51,105 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 569 transitions. [2024-10-13 03:10:51,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:10:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 569 transitions. [2024-10-13 03:10:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 03:10:51,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:10:51,107 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:51,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 03:10:51,107 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:10:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:10:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash -647744933, now seen corresponding path program 1 times [2024-10-13 03:10:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:10:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847705490] [2024-10-13 03:10:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:10:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:10:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat