./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash fc3dd6a87fcbbda92d2ef86eac2f1110715a91bf4cd8be375753a9611c0b48d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:37:16,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:37:16,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:37:16,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:37:16,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:37:16,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:37:16,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:37:16,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:37:16,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:37:16,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:37:16,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:37:16,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:37:16,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:37:16,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:37:16,146 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:37:16,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:37:16,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:37:16,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:37:16,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:37:16,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:37:16,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:37:16,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:37:16,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:37:16,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:37:16,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:37:16,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:37:16,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:37:16,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:37:16,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:37:16,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:16,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:37:16,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:37:16,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:37:16,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:37:16,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:37:16,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:37:16,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:37:16,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:37:16,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:37:16,170 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc3dd6a87fcbbda92d2ef86eac2f1110715a91bf4cd8be375753a9611c0b48d5 [2024-10-12 22:37:16,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:37:16,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:37:16,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:37:16,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:37:16,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:37:16,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2024-10-12 22:37:17,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:37:18,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:37:18,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2024-10-12 22:37:18,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e8e14c4/4ec96c6011ef489a8dd9f64c793b943d/FLAG4283b457f [2024-10-12 22:37:18,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e8e14c4/4ec96c6011ef489a8dd9f64c793b943d [2024-10-12 22:37:18,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:37:18,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:37:18,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:18,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:37:18,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:37:18,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:18,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4d47b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18, skipping insertion in model container [2024-10-12 22:37:18,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:18,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:37:18,434 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2024-10-12 22:37:18,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:18,700 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:37:18,711 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2024-10-12 22:37:18,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:18,884 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:37:18,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18 WrapperNode [2024-10-12 22:37:18,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:18,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:18,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:37:18,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:37:18,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:18,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,170 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1977 [2024-10-12 22:37:19,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:19,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:37:19,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:37:19,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:37:19,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,281 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-12 22:37:19,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:37:19,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:37:19,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:37:19,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:37:19,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (1/1) ... [2024-10-12 22:37:19,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:19,500 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-12 22:37:19,504 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-12 22:37:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:37:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 22:37:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 22:37:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:37:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:37:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:37:19,828 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:37:19,830 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:37:21,929 INFO L? ?]: Removed 1091 outVars from TransFormulas that were not future-live. [2024-10-12 22:37:21,930 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:37:22,002 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:37:22,006 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:37:22,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:22 BoogieIcfgContainer [2024-10-12 22:37:22,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:37:22,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:37:22,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:37:22,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:37:22,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:37:18" (1/3) ... [2024-10-12 22:37:22,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2252accc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:22, skipping insertion in model container [2024-10-12 22:37:22,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:18" (2/3) ... [2024-10-12 22:37:22,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2252accc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:22, skipping insertion in model container [2024-10-12 22:37:22,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:22" (3/3) ... [2024-10-12 22:37:22,015 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2024-10-12 22:37:22,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:37:22,032 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:37:22,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:37:22,125 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;@3ab0471f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:37:22,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:37:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 549 states, 543 states have (on average 1.4972375690607735) internal successors, (813), 544 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 22:37:22,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:22,149 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:22,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -185767001, now seen corresponding path program 1 times [2024-10-12 22:37:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021749644] [2024-10-12 22:37:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021749644] [2024-10-12 22:37:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021749644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 22:37:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355984074] [2024-10-12 22:37:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:22,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 22:37:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:22,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 22:37:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 22:37:22,749 INFO L87 Difference]: Start difference. First operand has 549 states, 543 states have (on average 1.4972375690607735) internal successors, (813), 544 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:22,826 INFO L93 Difference]: Finished difference Result 996 states and 1490 transitions. [2024-10-12 22:37:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 22:37:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 148 [2024-10-12 22:37:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:22,845 INFO L225 Difference]: With dead ends: 996 [2024-10-12 22:37:22,846 INFO L226 Difference]: Without dead ends: 548 [2024-10-12 22:37:22,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-12 22:37:22,854 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:22,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 815 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-12 22:37:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2024-10-12 22:37:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 543 states have (on average 1.4917127071823204) internal successors, (810), 543 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2024-10-12 22:37:22,941 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 148 [2024-10-12 22:37:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:22,943 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2024-10-12 22:37:22,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2024-10-12 22:37:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 22:37:22,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:22,981 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:22,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:37:22,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash 386034401, now seen corresponding path program 1 times [2024-10-12 22:37:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262096860] [2024-10-12 22:37:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262096860] [2024-10-12 22:37:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262096860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:24,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182336447] [2024-10-12 22:37:24,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:24,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:24,115 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:24,173 INFO L93 Difference]: Finished difference Result 552 states and 820 transitions. [2024-10-12 22:37:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 148 [2024-10-12 22:37:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:24,178 INFO L225 Difference]: With dead ends: 552 [2024-10-12 22:37:24,179 INFO L226 Difference]: Without dead ends: 550 [2024-10-12 22:37:24,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:24,181 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 0 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:24,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2434 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-12 22:37:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-10-12 22:37:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.489908256880734) internal successors, (812), 545 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2024-10-12 22:37:24,210 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 148 [2024-10-12 22:37:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:24,212 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2024-10-12 22:37:24,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2024-10-12 22:37:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 22:37:24,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:24,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:24,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:37:24,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:24,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash -916139479, now seen corresponding path program 1 times [2024-10-12 22:37:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664662943] [2024-10-12 22:37:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664662943] [2024-10-12 22:37:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664662943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336947672] [2024-10-12 22:37:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:24,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:24,772 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:25,235 INFO L93 Difference]: Finished difference Result 1370 states and 2040 transitions. [2024-10-12 22:37:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2024-10-12 22:37:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:25,239 INFO L225 Difference]: With dead ends: 1370 [2024-10-12 22:37:25,241 INFO L226 Difference]: Without dead ends: 550 [2024-10-12 22:37:25,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:37:25,245 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 1618 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:25,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 2346 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-12 22:37:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-10-12 22:37:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4880733944954128) internal successors, (811), 545 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 817 transitions. [2024-10-12 22:37:25,261 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 817 transitions. Word has length 149 [2024-10-12 22:37:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:25,262 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 817 transitions. [2024-10-12 22:37:25,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 817 transitions. [2024-10-12 22:37:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 22:37:25,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:25,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:25,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:37:25,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2116961565, now seen corresponding path program 1 times [2024-10-12 22:37:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756053873] [2024-10-12 22:37:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756053873] [2024-10-12 22:37:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756053873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:25,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125087973] [2024-10-12 22:37:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:25,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:25,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:25,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:25,764 INFO L87 Difference]: Start difference. First operand 550 states and 817 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:25,802 INFO L93 Difference]: Finished difference Result 1001 states and 1486 transitions. [2024-10-12 22:37:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2024-10-12 22:37:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:25,807 INFO L225 Difference]: With dead ends: 1001 [2024-10-12 22:37:25,807 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:25,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:25,812 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 0 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:25,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2428 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4862888482632541) internal successors, (813), 547 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 819 transitions. [2024-10-12 22:37:25,826 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 819 transitions. Word has length 150 [2024-10-12 22:37:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:25,827 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 819 transitions. [2024-10-12 22:37:25,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 819 transitions. [2024-10-12 22:37:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 22:37:25,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:25,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:25,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:37:25,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:25,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1995703104, now seen corresponding path program 1 times [2024-10-12 22:37:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491015331] [2024-10-12 22:37:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:26,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491015331] [2024-10-12 22:37:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491015331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:26,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:26,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541470477] [2024-10-12 22:37:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:26,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:26,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:26,415 INFO L87 Difference]: Start difference. First operand 552 states and 819 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:26,541 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2024-10-12 22:37:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2024-10-12 22:37:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:26,544 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:26,545 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:26,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:26,548 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 702 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:26,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1546 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4844606946983547) internal successors, (812), 547 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 818 transitions. [2024-10-12 22:37:26,560 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 818 transitions. Word has length 151 [2024-10-12 22:37:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:26,561 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 818 transitions. [2024-10-12 22:37:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 818 transitions. [2024-10-12 22:37:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 22:37:26,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:26,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:26,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:37:26,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:26,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -334083056, now seen corresponding path program 1 times [2024-10-12 22:37:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628203621] [2024-10-12 22:37:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628203621] [2024-10-12 22:37:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628203621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138988620] [2024-10-12 22:37:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:27,021 INFO L87 Difference]: Start difference. First operand 552 states and 818 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:27,136 INFO L93 Difference]: Finished difference Result 1009 states and 1493 transitions. [2024-10-12 22:37:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 152 [2024-10-12 22:37:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:27,139 INFO L225 Difference]: With dead ends: 1009 [2024-10-12 22:37:27,139 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:27,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:27,141 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 713 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:27,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2385 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.482632541133455) internal successors, (811), 547 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 817 transitions. [2024-10-12 22:37:27,154 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 817 transitions. Word has length 152 [2024-10-12 22:37:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:27,155 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 817 transitions. [2024-10-12 22:37:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 817 transitions. [2024-10-12 22:37:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 22:37:27,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:27,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:27,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:37:27,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:27,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1729904971, now seen corresponding path program 1 times [2024-10-12 22:37:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:27,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102681625] [2024-10-12 22:37:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:27,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:27,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102681625] [2024-10-12 22:37:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102681625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:27,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658793580] [2024-10-12 22:37:27,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:27,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:27,539 INFO L87 Difference]: Start difference. First operand 552 states and 817 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:27,651 INFO L93 Difference]: Finished difference Result 1003 states and 1483 transitions. [2024-10-12 22:37:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-10-12 22:37:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:27,653 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:27,654 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:27,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:27,655 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 802 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:27,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1552 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4808043875685557) internal successors, (810), 547 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 816 transitions. [2024-10-12 22:37:27,665 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 816 transitions. Word has length 153 [2024-10-12 22:37:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 816 transitions. [2024-10-12 22:37:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 816 transitions. [2024-10-12 22:37:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 22:37:27,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:27,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:37:27,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:27,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash 871281751, now seen corresponding path program 1 times [2024-10-12 22:37:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955394362] [2024-10-12 22:37:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955394362] [2024-10-12 22:37:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955394362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:28,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:28,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255601881] [2024-10-12 22:37:28,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:28,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:28,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:28,054 INFO L87 Difference]: Start difference. First operand 552 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:28,167 INFO L93 Difference]: Finished difference Result 1003 states and 1481 transitions. [2024-10-12 22:37:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2024-10-12 22:37:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:28,170 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:28,171 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:28,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:28,172 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 798 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:28,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1552 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4789762340036563) internal successors, (809), 547 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 815 transitions. [2024-10-12 22:37:28,183 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 815 transitions. Word has length 154 [2024-10-12 22:37:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:28,184 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 815 transitions. [2024-10-12 22:37:28,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 815 transitions. [2024-10-12 22:37:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 22:37:28,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:28,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 22:37:28,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1040354958, now seen corresponding path program 1 times [2024-10-12 22:37:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123052972] [2024-10-12 22:37:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:28,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:28,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123052972] [2024-10-12 22:37:28,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123052972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:28,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:28,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664774514] [2024-10-12 22:37:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:28,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:28,792 INFO L87 Difference]: Start difference. First operand 552 states and 815 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:28,968 INFO L93 Difference]: Finished difference Result 1003 states and 1479 transitions. [2024-10-12 22:37:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2024-10-12 22:37:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:28,972 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:28,972 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:28,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:28,974 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 686 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:28,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1458 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.477148080438757) internal successors, (808), 547 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 814 transitions. [2024-10-12 22:37:28,987 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 814 transitions. Word has length 155 [2024-10-12 22:37:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:28,988 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 814 transitions. [2024-10-12 22:37:28,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 814 transitions. [2024-10-12 22:37:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 22:37:28,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:28,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:28,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 22:37:28,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:28,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash -158861950, now seen corresponding path program 1 times [2024-10-12 22:37:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:28,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248403683] [2024-10-12 22:37:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248403683] [2024-10-12 22:37:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248403683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459305643] [2024-10-12 22:37:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:29,382 INFO L87 Difference]: Start difference. First operand 552 states and 814 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:29,537 INFO L93 Difference]: Finished difference Result 1009 states and 1485 transitions. [2024-10-12 22:37:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2024-10-12 22:37:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:29,540 INFO L225 Difference]: With dead ends: 1009 [2024-10-12 22:37:29,540 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:29,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:29,541 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 697 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:29,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 2333 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4753199268738575) internal successors, (807), 547 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 813 transitions. [2024-10-12 22:37:29,553 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 813 transitions. Word has length 156 [2024-10-12 22:37:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:29,553 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 813 transitions. [2024-10-12 22:37:29,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 813 transitions. [2024-10-12 22:37:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-12 22:37:29,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:29,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:29,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 22:37:29,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:29,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash -401911171, now seen corresponding path program 1 times [2024-10-12 22:37:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:29,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441449375] [2024-10-12 22:37:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441449375] [2024-10-12 22:37:29,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441449375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:29,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937394702] [2024-10-12 22:37:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:29,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:29,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:29,942 INFO L87 Difference]: Start difference. First operand 552 states and 813 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:30,121 INFO L93 Difference]: Finished difference Result 1003 states and 1475 transitions. [2024-10-12 22:37:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2024-10-12 22:37:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:30,125 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:30,125 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:30,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:30,126 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 798 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:30,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1464 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4734917733089579) internal successors, (806), 547 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 812 transitions. [2024-10-12 22:37:30,139 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 812 transitions. Word has length 157 [2024-10-12 22:37:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:30,139 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 812 transitions. [2024-10-12 22:37:30,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 812 transitions. [2024-10-12 22:37:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-12 22:37:30,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:30,141 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:30,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 22:37:30,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:30,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash -959173431, now seen corresponding path program 1 times [2024-10-12 22:37:30,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:30,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982755582] [2024-10-12 22:37:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982755582] [2024-10-12 22:37:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982755582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429559870] [2024-10-12 22:37:30,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:30,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:30,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:30,484 INFO L87 Difference]: Start difference. First operand 552 states and 812 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:30,694 INFO L93 Difference]: Finished difference Result 1003 states and 1473 transitions. [2024-10-12 22:37:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2024-10-12 22:37:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:30,697 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:30,697 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:30,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:30,698 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 794 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:30,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1464 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4716636197440585) internal successors, (805), 547 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions. [2024-10-12 22:37:30,712 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 158 [2024-10-12 22:37:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:30,713 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 811 transitions. [2024-10-12 22:37:30,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions. [2024-10-12 22:37:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 22:37:30,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:30,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 22:37:30,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1672871516, now seen corresponding path program 1 times [2024-10-12 22:37:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068837096] [2024-10-12 22:37:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:31,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068837096] [2024-10-12 22:37:31,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068837096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:31,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:31,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455287146] [2024-10-12 22:37:31,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:31,219 INFO L87 Difference]: Start difference. First operand 552 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:31,400 INFO L93 Difference]: Finished difference Result 1003 states and 1471 transitions. [2024-10-12 22:37:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:31,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2024-10-12 22:37:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:31,403 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:31,403 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:31,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:31,405 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1461 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:31,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1458 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.469835466179159) internal successors, (804), 547 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2024-10-12 22:37:31,420 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 159 [2024-10-12 22:37:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2024-10-12 22:37:31,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2024-10-12 22:37:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-12 22:37:31,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:31,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:31,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 22:37:31,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:31,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 925686153, now seen corresponding path program 1 times [2024-10-12 22:37:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525664707] [2024-10-12 22:37:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525664707] [2024-10-12 22:37:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525664707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451559185] [2024-10-12 22:37:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:31,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:31,799 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:31,970 INFO L93 Difference]: Finished difference Result 1003 states and 1469 transitions. [2024-10-12 22:37:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2024-10-12 22:37:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:31,973 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:31,973 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:31,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:31,975 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 783 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:31,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1464 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 547 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 809 transitions. [2024-10-12 22:37:31,987 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 809 transitions. Word has length 160 [2024-10-12 22:37:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:31,987 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 809 transitions. [2024-10-12 22:37:31,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 809 transitions. [2024-10-12 22:37:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 22:37:31,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:31,989 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 22:37:31,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1086953085, now seen corresponding path program 1 times [2024-10-12 22:37:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:31,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617515128] [2024-10-12 22:37:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617515128] [2024-10-12 22:37:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617515128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:32,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141415648] [2024-10-12 22:37:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:32,362 INFO L87 Difference]: Start difference. First operand 552 states and 809 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:32,534 INFO L93 Difference]: Finished difference Result 1003 states and 1467 transitions. [2024-10-12 22:37:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:32,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2024-10-12 22:37:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:32,537 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:32,537 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:32,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:32,539 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1445 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:32,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 1458 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4661791590493602) internal successors, (802), 547 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions. [2024-10-12 22:37:32,552 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 161 [2024-10-12 22:37:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:32,553 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 808 transitions. [2024-10-12 22:37:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions. [2024-10-12 22:37:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 22:37:32,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:32,554 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:32,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 22:37:32,555 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:32,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1586247038, now seen corresponding path program 1 times [2024-10-12 22:37:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:32,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295405066] [2024-10-12 22:37:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295405066] [2024-10-12 22:37:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295405066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222961577] [2024-10-12 22:37:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:32,967 INFO L87 Difference]: Start difference. First operand 552 states and 808 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:33,145 INFO L93 Difference]: Finished difference Result 1003 states and 1465 transitions. [2024-10-12 22:37:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2024-10-12 22:37:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:33,148 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:33,148 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:33,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:33,150 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1437 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:33,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1458 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4643510054844606) internal successors, (801), 547 states have internal predecessors, (801), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 807 transitions. [2024-10-12 22:37:33,162 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 807 transitions. Word has length 162 [2024-10-12 22:37:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 807 transitions. [2024-10-12 22:37:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 807 transitions. [2024-10-12 22:37:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 22:37:33,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:33,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:33,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 22:37:33,165 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:33,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1194570710, now seen corresponding path program 1 times [2024-10-12 22:37:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146769765] [2024-10-12 22:37:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146769765] [2024-10-12 22:37:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146769765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977383343] [2024-10-12 22:37:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:33,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:33,666 INFO L87 Difference]: Start difference. First operand 552 states and 807 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:33,736 INFO L93 Difference]: Finished difference Result 1003 states and 1463 transitions. [2024-10-12 22:37:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2024-10-12 22:37:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:33,739 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:33,739 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:33,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:33,740 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 699 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:33,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1562 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 547 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 805 transitions. [2024-10-12 22:37:33,754 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 805 transitions. Word has length 163 [2024-10-12 22:37:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:33,755 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 805 transitions. [2024-10-12 22:37:33,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 805 transitions. [2024-10-12 22:37:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-12 22:37:33,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:33,756 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:33,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 22:37:33,757 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:33,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1563044179, now seen corresponding path program 1 times [2024-10-12 22:37:33,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:33,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958622715] [2024-10-12 22:37:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:33,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:34,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:34,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958622715] [2024-10-12 22:37:34,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958622715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:34,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:34,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694273463] [2024-10-12 22:37:34,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:34,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:34,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:34,129 INFO L87 Difference]: Start difference. First operand 552 states and 805 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:34,206 INFO L93 Difference]: Finished difference Result 1003 states and 1459 transitions. [2024-10-12 22:37:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 165 [2024-10-12 22:37:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:34,209 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:34,209 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:34,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:34,211 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1481 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:34,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1562 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4588665447897624) internal successors, (798), 547 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2024-10-12 22:37:34,222 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 165 [2024-10-12 22:37:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:34,223 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2024-10-12 22:37:34,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2024-10-12 22:37:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 22:37:34,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:34,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:34,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 22:37:34,226 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:34,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1228719973, now seen corresponding path program 1 times [2024-10-12 22:37:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107401177] [2024-10-12 22:37:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 22:37:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107401177] [2024-10-12 22:37:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107401177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:34,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070282609] [2024-10-12 22:37:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:34,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:34,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:34,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:34,789 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:34,860 INFO L93 Difference]: Finished difference Result 1003 states and 1457 transitions. [2024-10-12 22:37:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2024-10-12 22:37:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:34,863 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:34,863 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:34,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:34,864 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 734 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:34,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1568 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4570383912248628) internal successors, (797), 547 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 803 transitions. [2024-10-12 22:37:34,880 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 803 transitions. Word has length 166 [2024-10-12 22:37:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:34,881 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 803 transitions. [2024-10-12 22:37:34,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 803 transitions. [2024-10-12 22:37:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 22:37:34,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:34,883 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 22:37:34,883 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:34,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash 873646117, now seen corresponding path program 1 times [2024-10-12 22:37:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:34,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145633098] [2024-10-12 22:37:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 22:37:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 22:37:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145633098] [2024-10-12 22:37:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145633098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:35,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:35,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:35,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007053863] [2024-10-12 22:37:35,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:35,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:35,384 INFO L87 Difference]: Start difference. First operand 552 states and 803 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:35,453 INFO L93 Difference]: Finished difference Result 1003 states and 1455 transitions. [2024-10-12 22:37:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:35,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 167 [2024-10-12 22:37:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:35,456 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 22:37:35,456 INFO L226 Difference]: Without dead ends: 552 [2024-10-12 22:37:35,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:35,458 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 732 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:35,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1568 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-12 22:37:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-12 22:37:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4552102376599634) internal successors, (796), 547 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions. [2024-10-12 22:37:35,476 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 167 [2024-10-12 22:37:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:35,477 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 802 transitions. [2024-10-12 22:37:35,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions. [2024-10-12 22:37:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 22:37:35,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:35,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:35,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 22:37:35,479 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -48804542, now seen corresponding path program 1 times [2024-10-12 22:37:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:35,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228474940] [2024-10-12 22:37:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 22:37:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 22:37:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228474940] [2024-10-12 22:37:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228474940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:37:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168860792] [2024-10-12 22:37:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:36,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:37:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:36,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:37:36,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:36,334 INFO L87 Difference]: Start difference. First operand 552 states and 802 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:36,713 INFO L93 Difference]: Finished difference Result 1069 states and 1549 transitions. [2024-10-12 22:37:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:37:36,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 168 [2024-10-12 22:37:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:36,716 INFO L225 Difference]: With dead ends: 1069 [2024-10-12 22:37:36,717 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:36,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 22:37:36,719 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 863 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:36,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 3690 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2024-10-12 22:37:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4517304189435336) internal successors, (797), 549 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 803 transitions. [2024-10-12 22:37:36,737 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 803 transitions. Word has length 168 [2024-10-12 22:37:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:36,738 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 803 transitions. [2024-10-12 22:37:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 803 transitions. [2024-10-12 22:37:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 22:37:36,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:36,741 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 22:37:36,741 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:36,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1591431925, now seen corresponding path program 1 times [2024-10-12 22:37:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:36,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363566083] [2024-10-12 22:37:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:37,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363566083] [2024-10-12 22:37:37,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363566083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:37,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:37,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:37,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159863985] [2024-10-12 22:37:37,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:37,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:37,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:37,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:37,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:37,664 INFO L87 Difference]: Start difference. First operand 554 states and 803 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:38,097 INFO L93 Difference]: Finished difference Result 1011 states and 1461 transitions. [2024-10-12 22:37:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 169 [2024-10-12 22:37:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:38,100 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:38,100 INFO L226 Difference]: Without dead ends: 558 [2024-10-12 22:37:38,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:38,101 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 756 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:38,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1806 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-12 22:37:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 556. [2024-10-12 22:37:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4500907441016333) internal successors, (799), 551 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 805 transitions. [2024-10-12 22:37:38,114 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 805 transitions. Word has length 169 [2024-10-12 22:37:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:38,115 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 805 transitions. [2024-10-12 22:37:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 805 transitions. [2024-10-12 22:37:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 22:37:38,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:38,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:38,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 22:37:38,117 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:38,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash -568859358, now seen corresponding path program 1 times [2024-10-12 22:37:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688223510] [2024-10-12 22:37:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688223510] [2024-10-12 22:37:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688223510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222622743] [2024-10-12 22:37:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:38,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:38,637 INFO L87 Difference]: Start difference. First operand 556 states and 805 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:38,745 INFO L93 Difference]: Finished difference Result 1011 states and 1459 transitions. [2024-10-12 22:37:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 170 [2024-10-12 22:37:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:38,748 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:38,748 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:38,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:38,749 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 682 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:38,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1518 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4482758620689655) internal successors, (798), 551 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 804 transitions. [2024-10-12 22:37:38,765 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 804 transitions. Word has length 170 [2024-10-12 22:37:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:38,766 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 804 transitions. [2024-10-12 22:37:38,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 804 transitions. [2024-10-12 22:37:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 22:37:38,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:38,768 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 22:37:38,769 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1772869966, now seen corresponding path program 1 times [2024-10-12 22:37:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528922488] [2024-10-12 22:37:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528922488] [2024-10-12 22:37:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528922488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:39,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475357605] [2024-10-12 22:37:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:39,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:39,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:39,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:39,414 INFO L87 Difference]: Start difference. First operand 556 states and 804 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:39,530 INFO L93 Difference]: Finished difference Result 1011 states and 1457 transitions. [2024-10-12 22:37:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2024-10-12 22:37:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:39,532 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:39,533 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:39,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:39,534 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 680 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:39,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1524 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4464609800362977) internal successors, (797), 551 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 803 transitions. [2024-10-12 22:37:39,549 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 803 transitions. Word has length 171 [2024-10-12 22:37:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:39,549 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 803 transitions. [2024-10-12 22:37:39,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 803 transitions. [2024-10-12 22:37:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 22:37:39,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:39,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 22:37:39,551 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:39,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1245572259, now seen corresponding path program 1 times [2024-10-12 22:37:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:39,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817242599] [2024-10-12 22:37:39,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817242599] [2024-10-12 22:37:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817242599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893582042] [2024-10-12 22:37:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:40,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:40,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:40,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:40,073 INFO L87 Difference]: Start difference. First operand 556 states and 803 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:40,190 INFO L93 Difference]: Finished difference Result 1011 states and 1455 transitions. [2024-10-12 22:37:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 172 [2024-10-12 22:37:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:40,193 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:40,193 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:40,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:40,198 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 1350 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:40,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1518 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4446460980036298) internal successors, (796), 551 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 802 transitions. [2024-10-12 22:37:40,220 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 802 transitions. Word has length 172 [2024-10-12 22:37:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:40,221 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 802 transitions. [2024-10-12 22:37:40,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 802 transitions. [2024-10-12 22:37:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-12 22:37:40,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:40,223 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:40,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 22:37:40,223 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1455036687, now seen corresponding path program 1 times [2024-10-12 22:37:40,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53877456] [2024-10-12 22:37:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:40,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:40,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53877456] [2024-10-12 22:37:40,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53877456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:40,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:40,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699021127] [2024-10-12 22:37:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:40,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:40,632 INFO L87 Difference]: Start difference. First operand 556 states and 802 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:40,816 INFO L93 Difference]: Finished difference Result 1011 states and 1453 transitions. [2024-10-12 22:37:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2024-10-12 22:37:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:40,819 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:40,819 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:40,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:40,820 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 664 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:40,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1440 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.442831215970962) internal successors, (795), 551 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2024-10-12 22:37:40,834 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 173 [2024-10-12 22:37:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:40,834 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2024-10-12 22:37:40,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2024-10-12 22:37:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 22:37:40,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:40,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:40,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 22:37:40,837 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash 116803075, now seen corresponding path program 1 times [2024-10-12 22:37:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102470514] [2024-10-12 22:37:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102470514] [2024-10-12 22:37:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102470514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278922161] [2024-10-12 22:37:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:41,336 INFO L87 Difference]: Start difference. First operand 556 states and 801 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:41,519 INFO L93 Difference]: Finished difference Result 1011 states and 1451 transitions. [2024-10-12 22:37:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2024-10-12 22:37:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:41,521 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:41,522 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:41,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:41,523 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 662 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:41,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1446 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 800 transitions. [2024-10-12 22:37:41,535 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 800 transitions. Word has length 174 [2024-10-12 22:37:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:41,536 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 800 transitions. [2024-10-12 22:37:41,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 800 transitions. [2024-10-12 22:37:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 22:37:41,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:41,538 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:41,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 22:37:41,538 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:41,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2081744846, now seen corresponding path program 1 times [2024-10-12 22:37:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:41,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653671468] [2024-10-12 22:37:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653671468] [2024-10-12 22:37:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653671468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:42,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:42,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955660073] [2024-10-12 22:37:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:42,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:42,017 INFO L87 Difference]: Start difference. First operand 556 states and 800 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:42,192 INFO L93 Difference]: Finished difference Result 1011 states and 1449 transitions. [2024-10-12 22:37:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 175 [2024-10-12 22:37:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:42,195 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:42,195 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:42,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:42,197 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 1314 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:42,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1440 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4392014519056262) internal successors, (793), 551 states have internal predecessors, (793), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 799 transitions. [2024-10-12 22:37:42,209 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 799 transitions. Word has length 175 [2024-10-12 22:37:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:42,209 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 799 transitions. [2024-10-12 22:37:42,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 799 transitions. [2024-10-12 22:37:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-12 22:37:42,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:42,212 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:42,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 22:37:42,212 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:42,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:42,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1575189374, now seen corresponding path program 1 times [2024-10-12 22:37:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:42,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528239275] [2024-10-12 22:37:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528239275] [2024-10-12 22:37:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528239275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513805808] [2024-10-12 22:37:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:42,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:42,712 INFO L87 Difference]: Start difference. First operand 556 states and 799 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:42,896 INFO L93 Difference]: Finished difference Result 1011 states and 1447 transitions. [2024-10-12 22:37:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 176 [2024-10-12 22:37:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:42,903 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:42,903 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:42,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:42,904 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 1308 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:42,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1440 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4373865698729582) internal successors, (792), 551 states have internal predecessors, (792), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 798 transitions. [2024-10-12 22:37:42,923 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 798 transitions. Word has length 176 [2024-10-12 22:37:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:42,923 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 798 transitions. [2024-10-12 22:37:42,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2024-10-12 22:37:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-12 22:37:42,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:42,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:42,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 22:37:42,926 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:42,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1939178995, now seen corresponding path program 1 times [2024-10-12 22:37:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:42,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429629566] [2024-10-12 22:37:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429629566] [2024-10-12 22:37:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429629566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957386469] [2024-10-12 22:37:43,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:43,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:43,436 INFO L87 Difference]: Start difference. First operand 556 states and 798 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:43,580 INFO L93 Difference]: Finished difference Result 1011 states and 1445 transitions. [2024-10-12 22:37:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:43,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2024-10-12 22:37:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:43,583 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:43,583 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:43,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:43,585 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 644 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:43,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1440 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4355716878402904) internal successors, (791), 551 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 797 transitions. [2024-10-12 22:37:43,598 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 797 transitions. Word has length 177 [2024-10-12 22:37:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:43,599 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 797 transitions. [2024-10-12 22:37:43,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 797 transitions. [2024-10-12 22:37:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-12 22:37:43,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:43,601 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:43,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 22:37:43,601 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:43,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:43,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1042592127, now seen corresponding path program 1 times [2024-10-12 22:37:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007370163] [2024-10-12 22:37:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:43,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007370163] [2024-10-12 22:37:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007370163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696117901] [2024-10-12 22:37:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:44,293 INFO L87 Difference]: Start difference. First operand 556 states and 797 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:44,473 INFO L93 Difference]: Finished difference Result 1011 states and 1443 transitions. [2024-10-12 22:37:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:44,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 178 [2024-10-12 22:37:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:44,476 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:44,476 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:44,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:44,477 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 658 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:44,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1446 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4337568058076224) internal successors, (790), 551 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 796 transitions. [2024-10-12 22:37:44,489 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 796 transitions. Word has length 178 [2024-10-12 22:37:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:44,490 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 796 transitions. [2024-10-12 22:37:44,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 796 transitions. [2024-10-12 22:37:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-12 22:37:44,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:44,492 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:44,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 22:37:44,492 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1865261108, now seen corresponding path program 1 times [2024-10-12 22:37:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695607342] [2024-10-12 22:37:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695607342] [2024-10-12 22:37:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695607342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857947362] [2024-10-12 22:37:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:44,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:44,986 INFO L87 Difference]: Start difference. First operand 556 states and 796 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:45,157 INFO L93 Difference]: Finished difference Result 1011 states and 1441 transitions. [2024-10-12 22:37:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 179 [2024-10-12 22:37:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:45,159 INFO L225 Difference]: With dead ends: 1011 [2024-10-12 22:37:45,160 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 22:37:45,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:45,161 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 657 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:45,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1446 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 22:37:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-12 22:37:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4319419237749547) internal successors, (789), 551 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 795 transitions. [2024-10-12 22:37:45,174 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 795 transitions. Word has length 179 [2024-10-12 22:37:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:45,174 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 795 transitions. [2024-10-12 22:37:45,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 795 transitions. [2024-10-12 22:37:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-12 22:37:45,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:45,176 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:45,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 22:37:45,176 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -278776832, now seen corresponding path program 1 times [2024-10-12 22:37:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817795881] [2024-10-12 22:37:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817795881] [2024-10-12 22:37:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817795881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:45,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868200477] [2024-10-12 22:37:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:45,988 INFO L87 Difference]: Start difference. First operand 556 states and 795 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:46,046 INFO L93 Difference]: Finished difference Result 1089 states and 1529 transitions. [2024-10-12 22:37:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2024-10-12 22:37:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:46,049 INFO L225 Difference]: With dead ends: 1089 [2024-10-12 22:37:46,049 INFO L226 Difference]: Without dead ends: 634 [2024-10-12 22:37:46,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:46,050 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 21 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:46,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3114 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-12 22:37:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2024-10-12 22:37:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 627 states have (on average 1.3955342902711323) internal successors, (875), 627 states have internal predecessors, (875), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 881 transitions. [2024-10-12 22:37:46,064 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 881 transitions. Word has length 180 [2024-10-12 22:37:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:46,064 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 881 transitions. [2024-10-12 22:37:46,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 881 transitions. [2024-10-12 22:37:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 22:37:46,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:46,066 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:46,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 22:37:46,066 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:46,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 856740426, now seen corresponding path program 1 times [2024-10-12 22:37:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096009456] [2024-10-12 22:37:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 22:37:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 22:37:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096009456] [2024-10-12 22:37:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096009456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:46,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:37:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510321052] [2024-10-12 22:37:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:46,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:37:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:46,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:37:46,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:46,668 INFO L87 Difference]: Start difference. First operand 632 states and 881 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:47,247 INFO L93 Difference]: Finished difference Result 1167 states and 1617 transitions. [2024-10-12 22:37:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 181 [2024-10-12 22:37:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:47,250 INFO L225 Difference]: With dead ends: 1167 [2024-10-12 22:37:47,250 INFO L226 Difference]: Without dead ends: 636 [2024-10-12 22:37:47,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:37:47,252 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 1493 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:47,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 2327 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-12 22:37:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2024-10-12 22:37:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 629 states have (on average 1.3926868044515104) internal successors, (876), 629 states have internal predecessors, (876), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 882 transitions. [2024-10-12 22:37:47,267 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 882 transitions. Word has length 181 [2024-10-12 22:37:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:47,267 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 882 transitions. [2024-10-12 22:37:47,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 882 transitions. [2024-10-12 22:37:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 22:37:47,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:47,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:47,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 22:37:47,269 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:47,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1952129003, now seen corresponding path program 1 times [2024-10-12 22:37:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:47,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536279357] [2024-10-12 22:37:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 22:37:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536279357] [2024-10-12 22:37:47,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536279357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:47,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:47,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:37:47,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916103661] [2024-10-12 22:37:47,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:37:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:47,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:37:47,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:47,881 INFO L87 Difference]: Start difference. First operand 634 states and 882 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:48,467 INFO L93 Difference]: Finished difference Result 1171 states and 1619 transitions. [2024-10-12 22:37:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 182 [2024-10-12 22:37:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:48,470 INFO L225 Difference]: With dead ends: 1171 [2024-10-12 22:37:48,470 INFO L226 Difference]: Without dead ends: 638 [2024-10-12 22:37:48,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:37:48,472 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 1475 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:48,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 2323 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-12 22:37:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2024-10-12 22:37:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 631 states have (on average 1.3898573692551506) internal successors, (877), 631 states have internal predecessors, (877), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 883 transitions. [2024-10-12 22:37:48,489 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 883 transitions. Word has length 182 [2024-10-12 22:37:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:48,489 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 883 transitions. [2024-10-12 22:37:48,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 883 transitions. [2024-10-12 22:37:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-12 22:37:48,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:48,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:48,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 22:37:48,492 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:48,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash -94203579, now seen corresponding path program 1 times [2024-10-12 22:37:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429142761] [2024-10-12 22:37:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 22:37:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429142761] [2024-10-12 22:37:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429142761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:49,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152597305] [2024-10-12 22:37:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:49,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:49,135 INFO L87 Difference]: Start difference. First operand 636 states and 883 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:49,697 INFO L93 Difference]: Finished difference Result 1173 states and 1618 transitions. [2024-10-12 22:37:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 183 [2024-10-12 22:37:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:49,701 INFO L225 Difference]: With dead ends: 1173 [2024-10-12 22:37:49,701 INFO L226 Difference]: Without dead ends: 638 [2024-10-12 22:37:49,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:49,703 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 730 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:49,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2323 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-12 22:37:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 637. [2024-10-12 22:37:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 632 states have (on average 1.389240506329114) internal successors, (878), 632 states have internal predecessors, (878), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 884 transitions. [2024-10-12 22:37:49,718 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 884 transitions. Word has length 183 [2024-10-12 22:37:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:49,718 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 884 transitions. [2024-10-12 22:37:49,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 884 transitions. [2024-10-12 22:37:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-12 22:37:49,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:49,719 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:49,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 22:37:49,719 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1006111217, now seen corresponding path program 1 times [2024-10-12 22:37:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:49,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306581766] [2024-10-12 22:37:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 22:37:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 22:37:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306581766] [2024-10-12 22:37:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306581766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133346633] [2024-10-12 22:37:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:50,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:50,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:50,340 INFO L87 Difference]: Start difference. First operand 637 states and 884 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:50,932 INFO L93 Difference]: Finished difference Result 1175 states and 1620 transitions. [2024-10-12 22:37:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 184 [2024-10-12 22:37:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:50,936 INFO L225 Difference]: With dead ends: 1175 [2024-10-12 22:37:50,936 INFO L226 Difference]: Without dead ends: 639 [2024-10-12 22:37:50,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:50,937 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 717 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:50,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2323 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-12 22:37:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 638. [2024-10-12 22:37:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 633 states have (on average 1.3886255924170616) internal successors, (879), 633 states have internal predecessors, (879), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 885 transitions. [2024-10-12 22:37:50,951 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 885 transitions. Word has length 184 [2024-10-12 22:37:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 885 transitions. [2024-10-12 22:37:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 885 transitions. [2024-10-12 22:37:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-12 22:37:50,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:50,953 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:50,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 22:37:50,954 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1940505527, now seen corresponding path program 1 times [2024-10-12 22:37:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33136992] [2024-10-12 22:37:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 22:37:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33136992] [2024-10-12 22:37:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33136992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:51,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:51,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967421] [2024-10-12 22:37:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:51,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:51,708 INFO L87 Difference]: Start difference. First operand 638 states and 885 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:52,118 INFO L93 Difference]: Finished difference Result 1179 states and 1625 transitions. [2024-10-12 22:37:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 185 [2024-10-12 22:37:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:52,122 INFO L225 Difference]: With dead ends: 1179 [2024-10-12 22:37:52,122 INFO L226 Difference]: Without dead ends: 642 [2024-10-12 22:37:52,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:52,123 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 682 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:52,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1770 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-12 22:37:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2024-10-12 22:37:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 635 states have (on average 1.3874015748031496) internal successors, (881), 635 states have internal predecessors, (881), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 887 transitions. [2024-10-12 22:37:52,142 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 887 transitions. Word has length 185 [2024-10-12 22:37:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:52,143 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 887 transitions. [2024-10-12 22:37:52,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 887 transitions. [2024-10-12 22:37:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-12 22:37:52,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:52,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:52,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 22:37:52,145 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash -492002590, now seen corresponding path program 1 times [2024-10-12 22:37:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181699497] [2024-10-12 22:37:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 22:37:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:52,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181699497] [2024-10-12 22:37:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181699497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937413080] [2024-10-12 22:37:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:52,707 INFO L87 Difference]: Start difference. First operand 640 states and 887 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:52,979 INFO L93 Difference]: Finished difference Result 1179 states and 1623 transitions. [2024-10-12 22:37:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:52,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 185 [2024-10-12 22:37:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:52,983 INFO L225 Difference]: With dead ends: 1179 [2024-10-12 22:37:52,983 INFO L226 Difference]: Without dead ends: 640 [2024-10-12 22:37:52,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:52,986 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 733 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:52,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1183 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-12 22:37:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2024-10-12 22:37:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 635 states have (on average 1.384251968503937) internal successors, (879), 635 states have internal predecessors, (879), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 885 transitions. [2024-10-12 22:37:53,000 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 885 transitions. Word has length 185 [2024-10-12 22:37:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:53,000 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 885 transitions. [2024-10-12 22:37:53,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 885 transitions. [2024-10-12 22:37:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-12 22:37:53,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:53,002 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:53,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 22:37:53,002 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:53,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash -671778661, now seen corresponding path program 1 times [2024-10-12 22:37:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026136496] [2024-10-12 22:37:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 22:37:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026136496] [2024-10-12 22:37:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026136496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:53,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:53,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:37:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138952336] [2024-10-12 22:37:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:53,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:37:53,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:37:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:37:53,621 INFO L87 Difference]: Start difference. First operand 640 states and 885 transitions. Second operand has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:54,495 INFO L93 Difference]: Finished difference Result 1718 states and 2356 transitions. [2024-10-12 22:37:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 22:37:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 186 [2024-10-12 22:37:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:54,499 INFO L225 Difference]: With dead ends: 1718 [2024-10-12 22:37:54,500 INFO L226 Difference]: Without dead ends: 1179 [2024-10-12 22:37:54,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:37:54,502 INFO L432 NwaCegarLoop]: 1153 mSDtfsCounter, 1345 mSDsluCounter, 4993 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 6146 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:54,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 6146 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 22:37:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-10-12 22:37:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1174. [2024-10-12 22:37:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1166 states have (on average 1.3747855917667238) internal successors, (1603), 1166 states have internal predecessors, (1603), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1615 transitions. [2024-10-12 22:37:54,534 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1615 transitions. Word has length 186 [2024-10-12 22:37:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:54,534 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1615 transitions. [2024-10-12 22:37:54,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1615 transitions. [2024-10-12 22:37:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-12 22:37:54,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:54,538 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:54,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 22:37:54,539 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:54,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1782802698, now seen corresponding path program 1 times [2024-10-12 22:37:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:54,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848368105] [2024-10-12 22:37:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 22:37:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848368105] [2024-10-12 22:37:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848368105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117468445] [2024-10-12 22:37:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:55,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:55,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:55,103 INFO L87 Difference]: Start difference. First operand 1174 states and 1615 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:55,636 INFO L93 Difference]: Finished difference Result 1181 states and 1620 transitions. [2024-10-12 22:37:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 187 [2024-10-12 22:37:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:55,639 INFO L225 Difference]: With dead ends: 1181 [2024-10-12 22:37:55,639 INFO L226 Difference]: Without dead ends: 642 [2024-10-12 22:37:55,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:55,642 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 707 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:55,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 2323 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-12 22:37:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 641. [2024-10-12 22:37:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 636 states have (on average 1.3836477987421383) internal successors, (880), 636 states have internal predecessors, (880), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 886 transitions. [2024-10-12 22:37:55,656 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 886 transitions. Word has length 187 [2024-10-12 22:37:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:55,656 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 886 transitions. [2024-10-12 22:37:55,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 886 transitions. [2024-10-12 22:37:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-12 22:37:55,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:55,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:55,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 22:37:55,658 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:55,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1415872086, now seen corresponding path program 1 times [2024-10-12 22:37:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:55,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600896754] [2024-10-12 22:37:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:37:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:56,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:56,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600896754] [2024-10-12 22:37:56,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600896754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:56,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:56,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:56,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093995066] [2024-10-12 22:37:56,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:56,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:56,627 INFO L87 Difference]: Start difference. First operand 641 states and 886 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:56,740 INFO L93 Difference]: Finished difference Result 1422 states and 1915 transitions. [2024-10-12 22:37:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:56,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 187 [2024-10-12 22:37:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:56,744 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:37:56,748 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:37:56,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:56,750 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1118 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:56,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3080 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:37:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:37:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3352402745995424) internal successors, (1167), 874 states have internal predecessors, (1167), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1179 transitions. [2024-10-12 22:37:56,807 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1179 transitions. Word has length 187 [2024-10-12 22:37:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:56,807 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1179 transitions. [2024-10-12 22:37:56,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1179 transitions. [2024-10-12 22:37:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-10-12 22:37:56,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:56,811 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:56,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 22:37:56,812 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:56,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1488593001, now seen corresponding path program 1 times [2024-10-12 22:37:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:56,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903664864] [2024-10-12 22:37:56,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:37:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-12 22:37:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-10-12 22:37:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-10-12 22:37:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903664864] [2024-10-12 22:37:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903664864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:57,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:57,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:57,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322541558] [2024-10-12 22:37:57,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:57,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:57,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:57,650 INFO L87 Difference]: Start difference. First operand 882 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:57,785 INFO L93 Difference]: Finished difference Result 1422 states and 1914 transitions. [2024-10-12 22:37:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461 [2024-10-12 22:37:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:57,792 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:37:57,796 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:37:57,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:57,798 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 720 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:57,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1440 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:37:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:37:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.334096109839817) internal successors, (1166), 874 states have internal predecessors, (1166), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1178 transitions. [2024-10-12 22:37:57,820 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1178 transitions. Word has length 461 [2024-10-12 22:37:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:57,821 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1178 transitions. [2024-10-12 22:37:57,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1178 transitions. [2024-10-12 22:37:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-10-12 22:37:57,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:57,825 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:57,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 22:37:57,825 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:57,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1112982073, now seen corresponding path program 1 times [2024-10-12 22:37:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344275991] [2024-10-12 22:37:57,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:37:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-10-12 22:37:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-10-12 22:37:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-10-12 22:37:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:58,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344275991] [2024-10-12 22:37:58,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344275991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:58,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:58,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:58,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813763903] [2024-10-12 22:37:58,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:58,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:58,697 INFO L87 Difference]: Start difference. First operand 882 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:58,819 INFO L93 Difference]: Finished difference Result 1422 states and 1912 transitions. [2024-10-12 22:37:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:58,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462 [2024-10-12 22:37:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:58,823 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:37:58,823 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:37:58,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:58,824 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 712 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:58,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1440 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:37:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:37:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3329519450800915) internal successors, (1165), 874 states have internal predecessors, (1165), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1177 transitions. [2024-10-12 22:37:58,842 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1177 transitions. Word has length 462 [2024-10-12 22:37:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:58,843 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1177 transitions. [2024-10-12 22:37:58,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1177 transitions. [2024-10-12 22:37:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-10-12 22:37:58,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:58,847 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:58,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 22:37:58,847 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:58,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2039118548, now seen corresponding path program 1 times [2024-10-12 22:37:58,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:58,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42253361] [2024-10-12 22:37:58,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:37:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:37:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-10-12 22:37:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-10-12 22:37:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-10-12 22:37:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42253361] [2024-10-12 22:37:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42253361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198840833] [2024-10-12 22:37:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:59,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:59,630 INFO L87 Difference]: Start difference. First operand 882 states and 1177 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:59,763 INFO L93 Difference]: Finished difference Result 1422 states and 1910 transitions. [2024-10-12 22:37:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:59,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463 [2024-10-12 22:37:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:59,770 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:37:59,771 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:37:59,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:59,772 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 704 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:59,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1440 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:37:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:37:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.331807780320366) internal successors, (1164), 874 states have internal predecessors, (1164), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1176 transitions. [2024-10-12 22:37:59,793 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1176 transitions. Word has length 463 [2024-10-12 22:37:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:59,794 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1176 transitions. [2024-10-12 22:37:59,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1176 transitions. [2024-10-12 22:37:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2024-10-12 22:37:59,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:59,797 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-12 22:37:59,798 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1558489682, now seen corresponding path program 1 times [2024-10-12 22:37:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774409748] [2024-10-12 22:37:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-10-12 22:38:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-10-12 22:38:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-10-12 22:38:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:00,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774409748] [2024-10-12 22:38:00,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774409748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:00,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:00,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030429037] [2024-10-12 22:38:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:00,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:00,588 INFO L87 Difference]: Start difference. First operand 882 states and 1176 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:00,719 INFO L93 Difference]: Finished difference Result 1422 states and 1908 transitions. [2024-10-12 22:38:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464 [2024-10-12 22:38:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:00,724 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:00,724 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:00,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:00,725 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1263 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:00,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1434 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3306636155606408) internal successors, (1163), 874 states have internal predecessors, (1163), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1175 transitions. [2024-10-12 22:38:00,746 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1175 transitions. Word has length 464 [2024-10-12 22:38:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:00,746 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1175 transitions. [2024-10-12 22:38:00,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1175 transitions. [2024-10-12 22:38:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2024-10-12 22:38:00,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:00,750 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:00,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-12 22:38:00,750 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:00,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 698712511, now seen corresponding path program 1 times [2024-10-12 22:38:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252572330] [2024-10-12 22:38:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-10-12 22:38:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-12 22:38:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-10-12 22:38:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252572330] [2024-10-12 22:38:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252572330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892491175] [2024-10-12 22:38:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:01,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:01,535 INFO L87 Difference]: Start difference. First operand 882 states and 1175 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:01,683 INFO L93 Difference]: Finished difference Result 1422 states and 1906 transitions. [2024-10-12 22:38:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:01,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465 [2024-10-12 22:38:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:01,688 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:01,688 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:01,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:01,689 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1247 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:01,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1434 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3295194508009154) internal successors, (1162), 874 states have internal predecessors, (1162), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1174 transitions. [2024-10-12 22:38:01,715 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1174 transitions. Word has length 465 [2024-10-12 22:38:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:01,716 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1174 transitions. [2024-10-12 22:38:01,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1174 transitions. [2024-10-12 22:38:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-10-12 22:38:01,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:01,721 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:01,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-12 22:38:01,722 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -392942755, now seen corresponding path program 1 times [2024-10-12 22:38:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685508697] [2024-10-12 22:38:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-12 22:38:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-10-12 22:38:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-10-12 22:38:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:02,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685508697] [2024-10-12 22:38:02,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685508697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:02,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215826831] [2024-10-12 22:38:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:02,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:02,517 INFO L87 Difference]: Start difference. First operand 882 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:02,628 INFO L93 Difference]: Finished difference Result 1422 states and 1904 transitions. [2024-10-12 22:38:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466 [2024-10-12 22:38:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:02,632 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:02,633 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:02,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:02,634 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 680 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:02,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1440 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.32837528604119) internal successors, (1161), 874 states have internal predecessors, (1161), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1173 transitions. [2024-10-12 22:38:02,656 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1173 transitions. Word has length 466 [2024-10-12 22:38:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:02,657 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1173 transitions. [2024-10-12 22:38:02,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1173 transitions. [2024-10-12 22:38:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-12 22:38:02,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:02,661 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:02,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-12 22:38:02,661 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1657735894, now seen corresponding path program 1 times [2024-10-12 22:38:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137049582] [2024-10-12 22:38:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-10-12 22:38:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-10-12 22:38:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-10-12 22:38:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137049582] [2024-10-12 22:38:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137049582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:03,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223293022] [2024-10-12 22:38:03,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:03,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:03,388 INFO L87 Difference]: Start difference. First operand 882 states and 1173 transitions. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:03,498 INFO L93 Difference]: Finished difference Result 1422 states and 1902 transitions. [2024-10-12 22:38:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467 [2024-10-12 22:38:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:03,501 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:03,501 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:03,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:03,502 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 672 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:03,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1440 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3272311212814645) internal successors, (1160), 874 states have internal predecessors, (1160), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1172 transitions. [2024-10-12 22:38:03,520 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1172 transitions. Word has length 467 [2024-10-12 22:38:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1172 transitions. [2024-10-12 22:38:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1172 transitions. [2024-10-12 22:38:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-10-12 22:38:03,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:03,524 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:03,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-12 22:38:03,525 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1463058200, now seen corresponding path program 1 times [2024-10-12 22:38:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237805256] [2024-10-12 22:38:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-10-12 22:38:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-10-12 22:38:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-12 22:38:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237805256] [2024-10-12 22:38:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237805256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:04,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623846463] [2024-10-12 22:38:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:04,164 INFO L87 Difference]: Start difference. First operand 882 states and 1172 transitions. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:04,269 INFO L93 Difference]: Finished difference Result 1422 states and 1900 transitions. [2024-10-12 22:38:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468 [2024-10-12 22:38:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:04,272 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:04,272 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:04,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:04,273 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1199 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:04,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 1434 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.326086956521739) internal successors, (1159), 874 states have internal predecessors, (1159), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1171 transitions. [2024-10-12 22:38:04,292 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1171 transitions. Word has length 468 [2024-10-12 22:38:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:04,292 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1171 transitions. [2024-10-12 22:38:04,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1171 transitions. [2024-10-12 22:38:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-10-12 22:38:04,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:04,296 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-12 22:38:04,297 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:04,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1523411691, now seen corresponding path program 1 times [2024-10-12 22:38:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235663422] [2024-10-12 22:38:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-12 22:38:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-10-12 22:38:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-10-12 22:38:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:05,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235663422] [2024-10-12 22:38:05,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235663422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:05,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:05,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029602090] [2024-10-12 22:38:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:05,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:05,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:05,019 INFO L87 Difference]: Start difference. First operand 882 states and 1171 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:05,111 INFO L93 Difference]: Finished difference Result 1422 states and 1898 transitions. [2024-10-12 22:38:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:05,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469 [2024-10-12 22:38:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:05,115 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:05,115 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:05,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:05,117 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 641 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:05,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1488 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3249427917620138) internal successors, (1158), 874 states have internal predecessors, (1158), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1170 transitions. [2024-10-12 22:38:05,139 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1170 transitions. Word has length 469 [2024-10-12 22:38:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:05,140 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1170 transitions. [2024-10-12 22:38:05,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1170 transitions. [2024-10-12 22:38:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-10-12 22:38:05,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:05,144 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:05,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-12 22:38:05,144 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:05,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash -83989773, now seen corresponding path program 1 times [2024-10-12 22:38:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570141980] [2024-10-12 22:38:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-10-12 22:38:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-10-12 22:38:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-10-12 22:38:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570141980] [2024-10-12 22:38:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570141980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:05,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711841003] [2024-10-12 22:38:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:05,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:05,813 INFO L87 Difference]: Start difference. First operand 882 states and 1170 transitions. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:05,879 INFO L93 Difference]: Finished difference Result 1422 states and 1896 transitions. [2024-10-12 22:38:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470 [2024-10-12 22:38:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:05,882 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:05,882 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:05,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:05,884 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 1152 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:05,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1482 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3237986270022883) internal successors, (1157), 874 states have internal predecessors, (1157), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1169 transitions. [2024-10-12 22:38:05,905 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1169 transitions. Word has length 470 [2024-10-12 22:38:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:05,905 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1169 transitions. [2024-10-12 22:38:05,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1169 transitions. [2024-10-12 22:38:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-12 22:38:05,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:05,912 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:05,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-12 22:38:05,912 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:05,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1871716736, now seen corresponding path program 1 times [2024-10-12 22:38:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596914658] [2024-10-12 22:38:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-10-12 22:38:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-10-12 22:38:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-10-12 22:38:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596914658] [2024-10-12 22:38:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596914658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:06,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256387843] [2024-10-12 22:38:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:06,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:06,616 INFO L87 Difference]: Start difference. First operand 882 states and 1169 transitions. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:06,700 INFO L93 Difference]: Finished difference Result 1422 states and 1894 transitions. [2024-10-12 22:38:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:06,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471 [2024-10-12 22:38:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:06,703 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:06,703 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:06,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:06,704 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 1136 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:06,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1482 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.322654462242563) internal successors, (1156), 874 states have internal predecessors, (1156), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1168 transitions. [2024-10-12 22:38:06,719 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1168 transitions. Word has length 471 [2024-10-12 22:38:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:06,720 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1168 transitions. [2024-10-12 22:38:06,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1168 transitions. [2024-10-12 22:38:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-12 22:38:06,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:06,723 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:06,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-12 22:38:06,723 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:06,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash -234837634, now seen corresponding path program 1 times [2024-10-12 22:38:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221363025] [2024-10-12 22:38:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-12 22:38:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-10-12 22:38:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-10-12 22:38:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221363025] [2024-10-12 22:38:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221363025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:07,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685549254] [2024-10-12 22:38:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:07,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:07,343 INFO L87 Difference]: Start difference. First operand 882 states and 1168 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:07,406 INFO L93 Difference]: Finished difference Result 1422 states and 1892 transitions. [2024-10-12 22:38:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472 [2024-10-12 22:38:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:07,408 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:07,408 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:07,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:07,409 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 617 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:07,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1488 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3215102974828374) internal successors, (1155), 874 states have internal predecessors, (1155), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1167 transitions. [2024-10-12 22:38:07,425 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1167 transitions. Word has length 472 [2024-10-12 22:38:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:07,426 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1167 transitions. [2024-10-12 22:38:07,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1167 transitions. [2024-10-12 22:38:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-12 22:38:07,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:07,429 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:07,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-12 22:38:07,430 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:07,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1192188523, now seen corresponding path program 1 times [2024-10-12 22:38:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19006529] [2024-10-12 22:38:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-12 22:38:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-10-12 22:38:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-10-12 22:38:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19006529] [2024-10-12 22:38:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19006529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:08,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:08,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585572449] [2024-10-12 22:38:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:08,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:08,417 INFO L87 Difference]: Start difference. First operand 882 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:08,466 INFO L93 Difference]: Finished difference Result 1422 states and 1890 transitions. [2024-10-12 22:38:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473 [2024-10-12 22:38:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:08,468 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:08,468 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:08,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:08,470 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 602 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:08,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1512 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3203661327231122) internal successors, (1154), 874 states have internal predecessors, (1154), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1166 transitions. [2024-10-12 22:38:08,496 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1166 transitions. Word has length 473 [2024-10-12 22:38:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1166 transitions. [2024-10-12 22:38:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1166 transitions. [2024-10-12 22:38:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-10-12 22:38:08,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:08,501 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:08,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-12 22:38:08,501 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:08,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -167379831, now seen corresponding path program 1 times [2024-10-12 22:38:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923012485] [2024-10-12 22:38:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-12 22:38:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-10-12 22:38:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-10-12 22:38:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923012485] [2024-10-12 22:38:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923012485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:09,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:09,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677645186] [2024-10-12 22:38:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:09,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:09,202 INFO L87 Difference]: Start difference. First operand 882 states and 1166 transitions. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:09,251 INFO L93 Difference]: Finished difference Result 1422 states and 1888 transitions. [2024-10-12 22:38:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474 [2024-10-12 22:38:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:09,253 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:09,254 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:09,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:09,255 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 594 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:09,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1512 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3192219679633868) internal successors, (1153), 874 states have internal predecessors, (1153), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1165 transitions. [2024-10-12 22:38:09,271 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1165 transitions. Word has length 474 [2024-10-12 22:38:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:09,272 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1165 transitions. [2024-10-12 22:38:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1165 transitions. [2024-10-12 22:38:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-12 22:38:09,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:09,276 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:09,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-12 22:38:09,276 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:09,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1398144982, now seen corresponding path program 1 times [2024-10-12 22:38:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941871582] [2024-10-12 22:38:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-10-12 22:38:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-10-12 22:38:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-12 22:38:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941871582] [2024-10-12 22:38:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941871582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:10,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:10,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783880925] [2024-10-12 22:38:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:10,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:10,028 INFO L87 Difference]: Start difference. First operand 882 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:10,274 INFO L93 Difference]: Finished difference Result 1422 states and 1886 transitions. [2024-10-12 22:38:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:10,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2024-10-12 22:38:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:10,276 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:10,276 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:10,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:10,277 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 1015 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:10,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1148 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:38:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3180778032036613) internal successors, (1152), 874 states have internal predecessors, (1152), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1164 transitions. [2024-10-12 22:38:10,294 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1164 transitions. Word has length 475 [2024-10-12 22:38:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:10,294 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1164 transitions. [2024-10-12 22:38:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1164 transitions. [2024-10-12 22:38:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-10-12 22:38:10,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:10,298 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:10,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-12 22:38:10,298 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1688347668, now seen corresponding path program 1 times [2024-10-12 22:38:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357389178] [2024-10-12 22:38:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-10-12 22:38:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-10-12 22:38:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-10-12 22:38:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357389178] [2024-10-12 22:38:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357389178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:38:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346055135] [2024-10-12 22:38:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:38:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:38:11,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:38:11,651 INFO L87 Difference]: Start difference. First operand 882 states and 1164 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:11,691 INFO L93 Difference]: Finished difference Result 1422 states and 1884 transitions. [2024-10-12 22:38:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2024-10-12 22:38:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:11,692 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:11,692 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:11,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:11,693 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 486 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:11,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1504 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3169336384439359) internal successors, (1151), 874 states have internal predecessors, (1151), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1163 transitions. [2024-10-12 22:38:11,710 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1163 transitions. Word has length 476 [2024-10-12 22:38:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:11,711 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1163 transitions. [2024-10-12 22:38:11,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1163 transitions. [2024-10-12 22:38:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-10-12 22:38:11,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:11,714 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:11,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-12 22:38:11,714 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 759657252, now seen corresponding path program 1 times [2024-10-12 22:38:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:11,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744628621] [2024-10-12 22:38:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-10-12 22:38:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-10-12 22:38:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-10-12 22:38:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:12,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744628621] [2024-10-12 22:38:12,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744628621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:12,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:12,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096085183] [2024-10-12 22:38:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:12,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:12,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:12,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:12,774 INFO L87 Difference]: Start difference. First operand 882 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:12,846 INFO L93 Difference]: Finished difference Result 1422 states and 1882 transitions. [2024-10-12 22:38:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477 [2024-10-12 22:38:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:12,848 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:12,848 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:12,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:12,849 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 1158 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:12,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1474 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3157894736842106) internal successors, (1150), 874 states have internal predecessors, (1150), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1162 transitions. [2024-10-12 22:38:12,866 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1162 transitions. Word has length 477 [2024-10-12 22:38:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:12,866 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1162 transitions. [2024-10-12 22:38:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1162 transitions. [2024-10-12 22:38:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-12 22:38:12,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:12,870 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:12,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-12 22:38:12,870 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:12,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1714705452, now seen corresponding path program 1 times [2024-10-12 22:38:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:12,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904537136] [2024-10-12 22:38:12,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-10-12 22:38:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-10-12 22:38:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-10-12 22:38:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904537136] [2024-10-12 22:38:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904537136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:13,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656841397] [2024-10-12 22:38:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:13,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:13,996 INFO L87 Difference]: Start difference. First operand 882 states and 1162 transitions. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:14,079 INFO L93 Difference]: Finished difference Result 1422 states and 1880 transitions. [2024-10-12 22:38:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 478 [2024-10-12 22:38:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:14,081 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:14,081 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:14,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:14,082 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 645 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:14,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1480 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3146453089244852) internal successors, (1149), 874 states have internal predecessors, (1149), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1161 transitions. [2024-10-12 22:38:14,099 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1161 transitions. Word has length 478 [2024-10-12 22:38:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:14,100 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1161 transitions. [2024-10-12 22:38:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1161 transitions. [2024-10-12 22:38:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-12 22:38:14,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:14,103 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:14,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-12 22:38:14,104 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -453781323, now seen corresponding path program 1 times [2024-10-12 22:38:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133277392] [2024-10-12 22:38:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-10-12 22:38:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-10-12 22:38:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-10-12 22:38:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133277392] [2024-10-12 22:38:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133277392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:38:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586428631] [2024-10-12 22:38:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:38:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:38:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:38:15,421 INFO L87 Difference]: Start difference. First operand 882 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:15,502 INFO L93 Difference]: Finished difference Result 1422 states and 1878 transitions. [2024-10-12 22:38:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 479 [2024-10-12 22:38:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:15,504 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:15,504 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:15,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:15,505 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 495 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:15,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1474 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3135011441647597) internal successors, (1148), 874 states have internal predecessors, (1148), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1160 transitions. [2024-10-12 22:38:15,529 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1160 transitions. Word has length 479 [2024-10-12 22:38:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:15,530 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1160 transitions. [2024-10-12 22:38:15,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1160 transitions. [2024-10-12 22:38:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-10-12 22:38:15,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:15,536 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:15,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-12 22:38:15,536 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1957893757, now seen corresponding path program 1 times [2024-10-12 22:38:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:15,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711610695] [2024-10-12 22:38:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-10-12 22:38:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-10-12 22:38:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-10-12 22:38:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711610695] [2024-10-12 22:38:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711610695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412072499] [2024-10-12 22:38:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:16,648 INFO L87 Difference]: Start difference. First operand 882 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:16,768 INFO L93 Difference]: Finished difference Result 1422 states and 1876 transitions. [2024-10-12 22:38:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480 [2024-10-12 22:38:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:16,771 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:16,771 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:16,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:16,772 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 1193 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:16,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1412 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3123569794050343) internal successors, (1147), 874 states have internal predecessors, (1147), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1159 transitions. [2024-10-12 22:38:16,788 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1159 transitions. Word has length 480 [2024-10-12 22:38:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:16,789 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1159 transitions. [2024-10-12 22:38:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1159 transitions. [2024-10-12 22:38:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-10-12 22:38:16,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:16,792 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:16,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-12 22:38:16,793 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1075255123, now seen corresponding path program 1 times [2024-10-12 22:38:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112351982] [2024-10-12 22:38:16,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:16,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-10-12 22:38:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-10-12 22:38:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-10-12 22:38:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112351982] [2024-10-12 22:38:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112351982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808725271] [2024-10-12 22:38:18,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:18,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:18,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:18,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:18,122 INFO L87 Difference]: Start difference. First operand 882 states and 1159 transitions. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:18,255 INFO L93 Difference]: Finished difference Result 1422 states and 1874 transitions. [2024-10-12 22:38:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:18,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 481 [2024-10-12 22:38:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:18,257 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:18,257 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:18,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:18,258 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 1183 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:18,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1412 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.311212814645309) internal successors, (1146), 874 states have internal predecessors, (1146), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1158 transitions. [2024-10-12 22:38:18,275 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1158 transitions. Word has length 481 [2024-10-12 22:38:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:18,275 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1158 transitions. [2024-10-12 22:38:18,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1158 transitions. [2024-10-12 22:38:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-12 22:38:18,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:18,279 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-12 22:38:18,280 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:18,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:18,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1774836398, now seen corresponding path program 1 times [2024-10-12 22:38:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760886065] [2024-10-12 22:38:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:38:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 22:38:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-10-12 22:38:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-12 22:38:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-10-12 22:38:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760886065] [2024-10-12 22:38:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760886065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:19,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:19,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:38:19,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763373000] [2024-10-12 22:38:19,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:19,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:38:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:19,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:38:19,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:38:19,387 INFO L87 Difference]: Start difference. First operand 882 states and 1158 transitions. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:19,479 INFO L93 Difference]: Finished difference Result 1422 states and 1872 transitions. [2024-10-12 22:38:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 482 [2024-10-12 22:38:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:19,481 INFO L225 Difference]: With dead ends: 1422 [2024-10-12 22:38:19,481 INFO L226 Difference]: Without dead ends: 882 [2024-10-12 22:38:19,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:19,482 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 548 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:19,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1412 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-12 22:38:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-10-12 22:38:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 874 states have (on average 1.3100686498855836) internal successors, (1145), 874 states have internal predecessors, (1145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:38:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1157 transitions. [2024-10-12 22:38:19,498 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1157 transitions. Word has length 482 [2024-10-12 22:38:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:19,499 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1157 transitions. [2024-10-12 22:38:19,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1157 transitions. [2024-10-12 22:38:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-12 22:38:19,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:19,533 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:38:19,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-12 22:38:19,536 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:19,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1839411268, now seen corresponding path program 1 times [2024-10-12 22:38:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:19,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812470622] [2024-10-12 22:38:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms