./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d32_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 3dcfde8a71d42fe3baf4d2089c86bd7d84b36e1d1bc23ee26c9bd4a8e8f007b4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:49:26,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:49:26,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:49:26,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:49:26,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:49:26,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:49:26,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:49:26,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:49:26,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:49:26,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:49:26,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:49:26,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:49:26,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:49:26,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:49:26,739 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:49:26,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:49:26,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:49:26,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:49:26,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:49:26,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:49:26,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:49:26,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:49:26,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:49:26,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:49:26,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:49:26,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:49:26,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:49:26,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:49:26,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:49:26,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:49:26,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:49:26,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:49:26,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:49:26,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:49:26,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:49:26,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:49:26,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:49:26,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:49:26,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:49:26,747 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 -> 3dcfde8a71d42fe3baf4d2089c86bd7d84b36e1d1bc23ee26c9bd4a8e8f007b4 [2024-11-16 10:49:27,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:49:27,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:49:27,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:49:27,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:49:27,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:49:27,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d32_e0.c [2024-11-16 10:49:28,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:49:28,743 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:49:28,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d32_e0.c [2024-11-16 10:49:28,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbbf5bc2/4ceae854025e41f59c2e1b6497fd6384/FLAG16810376d [2024-11-16 10:49:28,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbbf5bc2/4ceae854025e41f59c2e1b6497fd6384 [2024-11-16 10:49:28,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:49:28,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:49:28,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:49:28,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:49:28,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:49:28,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:28" (1/1) ... [2024-11-16 10:49:28,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3429c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:28, skipping insertion in model container [2024-11-16 10:49:28,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:28" (1/1) ... [2024-11-16 10:49:28,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:49:29,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d32_e0.c[1335,1348] [2024-11-16 10:49:29,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:49:29,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:49:29,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d32_e0.c[1335,1348] [2024-11-16 10:49:29,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:49:29,563 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:49:29,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29 WrapperNode [2024-11-16 10:49:29,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:49:29,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:49:29,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:49:29,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:49:29,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:29,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:29,984 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3162 [2024-11-16 10:49:29,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:49:29,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:49:29,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:49:29,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:49:29,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:29,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:49:30,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:49:30,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:49:30,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:49:30,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:49:30,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (1/1) ... [2024-11-16 10:49:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:49:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:49:30,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:49:30,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:49:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:49:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 10:49:30,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 10:49:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:49:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:49:30,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:49:30,812 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:49:30,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:49:34,180 INFO L? ?]: Removed 1764 outVars from TransFormulas that were not future-live. [2024-11-16 10:49:34,181 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:49:34,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:49:34,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:49:34,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:34 BoogieIcfgContainer [2024-11-16 10:49:34,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:49:34,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:49:34,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:49:34,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:49:34,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:49:28" (1/3) ... [2024-11-16 10:49:34,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b1710e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:34, skipping insertion in model container [2024-11-16 10:49:34,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:29" (2/3) ... [2024-11-16 10:49:34,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b1710e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:34, skipping insertion in model container [2024-11-16 10:49:34,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:34" (3/3) ... [2024-11-16 10:49:34,329 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d32_e0.c [2024-11-16 10:49:34,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:49:34,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:49:34,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:49:34,450 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;@59c0b450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:49:34,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:49:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 875 states, 869 states have (on average 1.4948216340621403) internal successors, (1299), 870 states have internal predecessors, (1299), 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-11-16 10:49:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-16 10:49:34,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:34,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:34,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:34,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1835944870, now seen corresponding path program 1 times [2024-11-16 10:49:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428621258] [2024-11-16 10:49:34,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:35,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:35,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428621258] [2024-11-16 10:49:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428621258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:35,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 10:49:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158874583] [2024-11-16 10:49:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:35,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 10:49:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 10:49:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:49:35,192 INFO L87 Difference]: Start difference. First operand has 875 states, 869 states have (on average 1.4948216340621403) internal successors, (1299), 870 states have internal predecessors, (1299), 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 101.0) internal successors, (202), 2 states have internal predecessors, (202), 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-11-16 10:49:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:35,542 INFO L93 Difference]: Finished difference Result 1579 states and 2361 transitions. [2024-11-16 10:49:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 10:49:35,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 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 214 [2024-11-16 10:49:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:35,571 INFO L225 Difference]: With dead ends: 1579 [2024-11-16 10:49:35,571 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:35,580 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-11-16 10:49:35,583 INFO L432 NwaCegarLoop]: 1085 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:35,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1085 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:49:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4936416184971097) internal successors, (1292), 865 states have internal predecessors, (1292), 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-11-16 10:49:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1298 transitions. [2024-11-16 10:49:35,679 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1298 transitions. Word has length 214 [2024-11-16 10:49:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:35,681 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1298 transitions. [2024-11-16 10:49:35,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 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-11-16 10:49:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1298 transitions. [2024-11-16 10:49:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-16 10:49:35,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:35,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:35,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:49:35,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1684730793, now seen corresponding path program 1 times [2024-11-16 10:49:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337310242] [2024-11-16 10:49:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337310242] [2024-11-16 10:49:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337310242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:37,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578324987] [2024-11-16 10:49:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:37,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:37,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:37,051 INFO L87 Difference]: Start difference. First operand 870 states and 1298 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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-11-16 10:49:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:37,789 INFO L93 Difference]: Finished difference Result 1574 states and 2348 transitions. [2024-11-16 10:49:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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 214 [2024-11-16 10:49:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:37,797 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:37,798 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:37,799 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-11-16 10:49:37,802 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1135 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:37,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1912 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:49:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.492485549132948) internal successors, (1291), 865 states have internal predecessors, (1291), 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-11-16 10:49:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1297 transitions. [2024-11-16 10:49:37,836 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1297 transitions. Word has length 214 [2024-11-16 10:49:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:37,838 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1297 transitions. [2024-11-16 10:49:37,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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-11-16 10:49:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1297 transitions. [2024-11-16 10:49:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-16 10:49:37,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:37,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:37,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:49:37,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1036890925, now seen corresponding path program 1 times [2024-11-16 10:49:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983081634] [2024-11-16 10:49:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983081634] [2024-11-16 10:49:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983081634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:38,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836341159] [2024-11-16 10:49:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:38,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:38,576 INFO L87 Difference]: Start difference. First operand 870 states and 1297 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 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-11-16 10:49:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:39,197 INFO L93 Difference]: Finished difference Result 1574 states and 2346 transitions. [2024-11-16 10:49:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:39,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 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 215 [2024-11-16 10:49:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:39,206 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:39,206 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:39,209 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-11-16 10:49:39,211 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2414 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:39,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 1912 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4913294797687862) internal successors, (1290), 865 states have internal predecessors, (1290), 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-11-16 10:49:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1296 transitions. [2024-11-16 10:49:39,267 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1296 transitions. Word has length 215 [2024-11-16 10:49:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1296 transitions. [2024-11-16 10:49:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 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-11-16 10:49:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1296 transitions. [2024-11-16 10:49:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 10:49:39,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:39,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:39,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:49:39,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:39,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 158343790, now seen corresponding path program 1 times [2024-11-16 10:49:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679188397] [2024-11-16 10:49:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679188397] [2024-11-16 10:49:39,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679188397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:39,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:39,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:39,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57943788] [2024-11-16 10:49:39,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:39,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:39,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:39,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:39,857 INFO L87 Difference]: Start difference. First operand 870 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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-11-16 10:49:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:40,469 INFO L93 Difference]: Finished difference Result 1574 states and 2344 transitions. [2024-11-16 10:49:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:40,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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 216 [2024-11-16 10:49:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:40,473 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:40,473 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:40,475 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-11-16 10:49:40,475 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1281 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:40,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1919 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4901734104046243) internal successors, (1289), 865 states have internal predecessors, (1289), 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-11-16 10:49:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1295 transitions. [2024-11-16 10:49:40,494 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1295 transitions. Word has length 216 [2024-11-16 10:49:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:40,495 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1295 transitions. [2024-11-16 10:49:40,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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-11-16 10:49:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1295 transitions. [2024-11-16 10:49:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 10:49:40,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:40,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:40,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:49:40,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -577394952, now seen corresponding path program 1 times [2024-11-16 10:49:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550606729] [2024-11-16 10:49:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550606729] [2024-11-16 10:49:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550606729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623545164] [2024-11-16 10:49:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:41,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:41,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:41,070 INFO L87 Difference]: Start difference. First operand 870 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-11-16 10:49:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:41,675 INFO L93 Difference]: Finished difference Result 1574 states and 2342 transitions. [2024-11-16 10:49:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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 217 [2024-11-16 10:49:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:41,680 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:41,680 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:41,682 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-11-16 10:49:41,685 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2398 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:41,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 1912 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4890173410404623) internal successors, (1288), 865 states have internal predecessors, (1288), 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-11-16 10:49:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1294 transitions. [2024-11-16 10:49:41,706 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1294 transitions. Word has length 217 [2024-11-16 10:49:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:41,706 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1294 transitions. [2024-11-16 10:49:41,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-11-16 10:49:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1294 transitions. [2024-11-16 10:49:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 10:49:41,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:41,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:41,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:49:41,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:41,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash -86095949, now seen corresponding path program 1 times [2024-11-16 10:49:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352753868] [2024-11-16 10:49:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352753868] [2024-11-16 10:49:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352753868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004944129] [2024-11-16 10:49:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:42,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:42,289 INFO L87 Difference]: Start difference. First operand 870 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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-11-16 10:49:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:42,898 INFO L93 Difference]: Finished difference Result 1574 states and 2340 transitions. [2024-11-16 10:49:42,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:42,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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 218 [2024-11-16 10:49:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:42,903 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:42,903 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49: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-11-16 10:49:42,905 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1273 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:42,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1919 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4878612716763007) internal successors, (1287), 865 states have internal predecessors, (1287), 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-11-16 10:49:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1293 transitions. [2024-11-16 10:49:42,926 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1293 transitions. Word has length 218 [2024-11-16 10:49:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:42,926 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1293 transitions. [2024-11-16 10:49:42,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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-11-16 10:49:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1293 transitions. [2024-11-16 10:49:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-16 10:49:42,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:42,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:49:42,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1800834973, now seen corresponding path program 1 times [2024-11-16 10:49:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307621141] [2024-11-16 10:49:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:43,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:43,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307621141] [2024-11-16 10:49:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307621141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:43,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:43,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640071499] [2024-11-16 10:49:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:43,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:43,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:43,511 INFO L87 Difference]: Start difference. First operand 870 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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-11-16 10:49:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:44,113 INFO L93 Difference]: Finished difference Result 1574 states and 2338 transitions. [2024-11-16 10:49:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:44,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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 219 [2024-11-16 10:49:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:44,117 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:44,118 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:44,119 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-11-16 10:49:44,120 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1269 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:44,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1919 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4867052023121388) internal successors, (1286), 865 states have internal predecessors, (1286), 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-11-16 10:49:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1292 transitions. [2024-11-16 10:49:44,138 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1292 transitions. Word has length 219 [2024-11-16 10:49:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:44,139 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1292 transitions. [2024-11-16 10:49:44,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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-11-16 10:49:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1292 transitions. [2024-11-16 10:49:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 10:49:44,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:44,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 10:49:44,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash 934388600, now seen corresponding path program 1 times [2024-11-16 10:49:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640722124] [2024-11-16 10:49:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640722124] [2024-11-16 10:49:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640722124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:44,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950657193] [2024-11-16 10:49:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:44,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:44,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:44,773 INFO L87 Difference]: Start difference. First operand 870 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-11-16 10:49:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:45,396 INFO L93 Difference]: Finished difference Result 1574 states and 2336 transitions. [2024-11-16 10:49:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:45,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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 220 [2024-11-16 10:49:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:45,400 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:45,401 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:45,403 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-11-16 10:49:45,406 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2374 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2377 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:45,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2377 Valid, 1912 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4855491329479769) internal successors, (1285), 865 states have internal predecessors, (1285), 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-11-16 10:49:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1291 transitions. [2024-11-16 10:49:45,428 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1291 transitions. Word has length 220 [2024-11-16 10:49:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:45,429 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1291 transitions. [2024-11-16 10:49:45,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-11-16 10:49:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1291 transitions. [2024-11-16 10:49:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-16 10:49:45,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:45,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:45,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 10:49:45,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1445152450, now seen corresponding path program 1 times [2024-11-16 10:49:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119185113] [2024-11-16 10:49:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119185113] [2024-11-16 10:49:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119185113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510671475] [2024-11-16 10:49:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:45,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:45,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:45,960 INFO L87 Difference]: Start difference. First operand 870 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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-11-16 10:49:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:46,568 INFO L93 Difference]: Finished difference Result 1574 states and 2334 transitions. [2024-11-16 10:49:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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 221 [2024-11-16 10:49:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:46,573 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:46,574 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:46,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:49:46,576 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2366 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:46,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 1912 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:49:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.484393063583815) internal successors, (1284), 865 states have internal predecessors, (1284), 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-11-16 10:49:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1290 transitions. [2024-11-16 10:49:46,596 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1290 transitions. Word has length 221 [2024-11-16 10:49:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:46,597 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1290 transitions. [2024-11-16 10:49:46,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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-11-16 10:49:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1290 transitions. [2024-11-16 10:49:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-16 10:49:46,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:46,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:46,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 10:49:46,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:46,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:46,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1539732925, now seen corresponding path program 1 times [2024-11-16 10:49:46,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867613502] [2024-11-16 10:49:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:47,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:47,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867613502] [2024-11-16 10:49:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867613502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186647069] [2024-11-16 10:49:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:47,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:47,067 INFO L87 Difference]: Start difference. First operand 870 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-11-16 10:49:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:47,643 INFO L93 Difference]: Finished difference Result 1574 states and 2332 transitions. [2024-11-16 10:49:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:47,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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 222 [2024-11-16 10:49:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:47,647 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:47,648 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:47,649 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-11-16 10:49:47,649 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2358 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:47,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 1912 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:49:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4832369942196533) internal successors, (1283), 865 states have internal predecessors, (1283), 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-11-16 10:49:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1289 transitions. [2024-11-16 10:49:47,670 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1289 transitions. Word has length 222 [2024-11-16 10:49:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:47,670 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1289 transitions. [2024-11-16 10:49:47,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-11-16 10:49:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1289 transitions. [2024-11-16 10:49:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-16 10:49:47,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:47,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:47,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 10:49:47,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash -49673113, now seen corresponding path program 1 times [2024-11-16 10:49:47,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:47,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903778521] [2024-11-16 10:49:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:48,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903778521] [2024-11-16 10:49:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903778521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:48,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681605585] [2024-11-16 10:49:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:48,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:48,228 INFO L87 Difference]: Start difference. First operand 870 states and 1289 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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-11-16 10:49:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:48,789 INFO L93 Difference]: Finished difference Result 1574 states and 2330 transitions. [2024-11-16 10:49:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 223 [2024-11-16 10:49:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:48,793 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:48,793 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:48,794 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-11-16 10:49:48,795 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2350 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:48,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 1912 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:49:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4820809248554914) internal successors, (1282), 865 states have internal predecessors, (1282), 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-11-16 10:49:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1288 transitions. [2024-11-16 10:49:48,813 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1288 transitions. Word has length 223 [2024-11-16 10:49:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:48,813 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1288 transitions. [2024-11-16 10:49:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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-11-16 10:49:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1288 transitions. [2024-11-16 10:49:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 10:49:48,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:48,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:48,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 10:49:48,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:48,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash -539427198, now seen corresponding path program 1 times [2024-11-16 10:49:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:48,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165321656] [2024-11-16 10:49:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165321656] [2024-11-16 10:49:49,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165321656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:49,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:49,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398991257] [2024-11-16 10:49:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:49,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:49,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:49,331 INFO L87 Difference]: Start difference. First operand 870 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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-11-16 10:49:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:49,857 INFO L93 Difference]: Finished difference Result 1574 states and 2328 transitions. [2024-11-16 10:49:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 224 [2024-11-16 10:49:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:49,861 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:49,861 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:49,862 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-11-16 10:49:49,863 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1249 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:49,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1919 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:49:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4809248554913295) internal successors, (1281), 865 states have internal predecessors, (1281), 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-11-16 10:49:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1287 transitions. [2024-11-16 10:49:49,881 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1287 transitions. Word has length 224 [2024-11-16 10:49:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:49,882 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1287 transitions. [2024-11-16 10:49:49,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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-11-16 10:49:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1287 transitions. [2024-11-16 10:49:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-16 10:49:49,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:49,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 10:49:49,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1820778356, now seen corresponding path program 1 times [2024-11-16 10:49:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:49,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500814848] [2024-11-16 10:49:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500814848] [2024-11-16 10:49:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500814848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939053209] [2024-11-16 10:49:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:50,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:50,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:50,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:50,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:50,401 INFO L87 Difference]: Start difference. First operand 870 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-11-16 10:49:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:50,920 INFO L93 Difference]: Finished difference Result 1574 states and 2326 transitions. [2024-11-16 10:49:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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 225 [2024-11-16 10:49:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:50,924 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:50,924 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:50,925 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-11-16 10:49:50,926 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2334 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:50,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 1912 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:49:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4797687861271676) internal successors, (1280), 865 states have internal predecessors, (1280), 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-11-16 10:49:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1286 transitions. [2024-11-16 10:49:50,944 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1286 transitions. Word has length 225 [2024-11-16 10:49:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:50,944 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1286 transitions. [2024-11-16 10:49:50,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-11-16 10:49:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1286 transitions. [2024-11-16 10:49:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-16 10:49:50,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:50,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:50,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 10:49:50,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:50,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1501920711, now seen corresponding path program 1 times [2024-11-16 10:49:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921344494] [2024-11-16 10:49:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921344494] [2024-11-16 10:49:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921344494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:51,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:51,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505496151] [2024-11-16 10:49:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:51,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:51,434 INFO L87 Difference]: Start difference. First operand 870 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-11-16 10:49:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:51,953 INFO L93 Difference]: Finished difference Result 1574 states and 2324 transitions. [2024-11-16 10:49:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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 226 [2024-11-16 10:49:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:51,958 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:51,959 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:51,960 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-11-16 10:49:51,961 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2326 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:51,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 1912 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:49:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4786127167630059) internal successors, (1279), 865 states have internal predecessors, (1279), 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-11-16 10:49:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1285 transitions. [2024-11-16 10:49:51,984 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1285 transitions. Word has length 226 [2024-11-16 10:49:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:51,984 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1285 transitions. [2024-11-16 10:49:51,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-11-16 10:49:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1285 transitions. [2024-11-16 10:49:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-16 10:49:51,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:51,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:51,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 10:49:51,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2126593231, now seen corresponding path program 1 times [2024-11-16 10:49:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808721163] [2024-11-16 10:49:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:51,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808721163] [2024-11-16 10:49:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808721163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:52,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678138278] [2024-11-16 10:49:52,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:52,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:52,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:52,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:52,538 INFO L87 Difference]: Start difference. First operand 870 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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-11-16 10:49:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:53,018 INFO L93 Difference]: Finished difference Result 1574 states and 2322 transitions. [2024-11-16 10:49:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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 227 [2024-11-16 10:49:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:53,022 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:53,022 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:53,023 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-11-16 10:49:53,024 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2318 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2321 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:53,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2321 Valid, 1912 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:49:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.477456647398844) internal successors, (1278), 865 states have internal predecessors, (1278), 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-11-16 10:49:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1284 transitions. [2024-11-16 10:49:53,040 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1284 transitions. Word has length 227 [2024-11-16 10:49:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:53,041 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1284 transitions. [2024-11-16 10:49:53,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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-11-16 10:49:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1284 transitions. [2024-11-16 10:49:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-16 10:49:53,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:53,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:53,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 10:49:53,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:53,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1152896116, now seen corresponding path program 1 times [2024-11-16 10:49:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:53,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661893972] [2024-11-16 10:49:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:53,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:53,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661893972] [2024-11-16 10:49:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661893972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:53,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493453453] [2024-11-16 10:49:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:53,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:53,467 INFO L87 Difference]: Start difference. First operand 870 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-11-16 10:49:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:53,946 INFO L93 Difference]: Finished difference Result 1574 states and 2320 transitions. [2024-11-16 10:49:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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 228 [2024-11-16 10:49:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:53,950 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:53,950 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:53,951 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-11-16 10:49:53,952 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1233 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:53,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1919 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:49:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.476300578034682) internal successors, (1277), 865 states have internal predecessors, (1277), 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-11-16 10:49:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1283 transitions. [2024-11-16 10:49:53,968 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1283 transitions. Word has length 228 [2024-11-16 10:49:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1283 transitions. [2024-11-16 10:49:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-11-16 10:49:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1283 transitions. [2024-11-16 10:49:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-16 10:49:53,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:53,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:53,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 10:49:53,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:53,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1031195562, now seen corresponding path program 1 times [2024-11-16 10:49:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035334606] [2024-11-16 10:49:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035334606] [2024-11-16 10:49:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035334606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595659001] [2024-11-16 10:49:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:54,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:54,494 INFO L87 Difference]: Start difference. First operand 870 states and 1283 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-11-16 10:49:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:55,029 INFO L93 Difference]: Finished difference Result 1574 states and 2318 transitions. [2024-11-16 10:49:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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 229 [2024-11-16 10:49:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:55,033 INFO L225 Difference]: With dead ends: 1574 [2024-11-16 10:49:55,034 INFO L226 Difference]: Without dead ends: 870 [2024-11-16 10:49:55,035 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-11-16 10:49:55,035 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 2302 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:55,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 1912 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:49:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-16 10:49:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-11-16 10:49:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4751445086705202) internal successors, (1276), 865 states have internal predecessors, (1276), 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-11-16 10:49:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1282 transitions. [2024-11-16 10:49:55,051 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1282 transitions. Word has length 229 [2024-11-16 10:49:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:55,052 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1282 transitions. [2024-11-16 10:49:55,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-11-16 10:49:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1282 transitions. [2024-11-16 10:49:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-16 10:49:55,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:55,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:55,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 10:49:55,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:55,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1803722799, now seen corresponding path program 1 times [2024-11-16 10:49:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:55,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078894827] [2024-11-16 10:49:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078894827] [2024-11-16 10:49:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078894827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411724394] [2024-11-16 10:49:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:55,808 INFO L87 Difference]: Start difference. First operand 870 states and 1282 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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-11-16 10:49:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:56,176 INFO L93 Difference]: Finished difference Result 875 states and 1287 transitions. [2024-11-16 10:49:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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 230 [2024-11-16 10:49:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:56,179 INFO L225 Difference]: With dead ends: 875 [2024-11-16 10:49:56,179 INFO L226 Difference]: Without dead ends: 872 [2024-11-16 10:49:56,179 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-11-16 10:49:56,180 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 0 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:56,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3196 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:49:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-16 10:49:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-11-16 10:49:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4740484429065743) internal successors, (1278), 867 states have internal predecessors, (1278), 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-11-16 10:49:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1284 transitions. [2024-11-16 10:49:56,196 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1284 transitions. Word has length 230 [2024-11-16 10:49:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:56,197 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1284 transitions. [2024-11-16 10:49:56,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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-11-16 10:49:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1284 transitions. [2024-11-16 10:49:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-16 10:49:56,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:56,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:56,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 10:49:56,200 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:56,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash 64222282, now seen corresponding path program 1 times [2024-11-16 10:49:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367985969] [2024-11-16 10:49:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367985969] [2024-11-16 10:49:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367985969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761954482] [2024-11-16 10:49:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:56,743 INFO L87 Difference]: Start difference. First operand 872 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-11-16 10:49:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:57,545 INFO L93 Difference]: Finished difference Result 2173 states and 3195 transitions. [2024-11-16 10:49:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:49:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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 231 [2024-11-16 10:49:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:57,548 INFO L225 Difference]: With dead ends: 2173 [2024-11-16 10:49:57,548 INFO L226 Difference]: Without dead ends: 872 [2024-11-16 10:49:57,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-11-16 10:49:57,551 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 2611 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:57,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 3027 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:49:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-16 10:49:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-11-16 10:49:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4728950403690888) internal successors, (1277), 867 states have internal predecessors, (1277), 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-11-16 10:49:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1283 transitions. [2024-11-16 10:49:57,570 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1283 transitions. Word has length 231 [2024-11-16 10:49:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:57,570 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1283 transitions. [2024-11-16 10:49:57,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-11-16 10:49:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1283 transitions. [2024-11-16 10:49:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-16 10:49:57,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:57,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:57,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 10:49:57,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:57,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1806639669, now seen corresponding path program 1 times [2024-11-16 10:49:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423837880] [2024-11-16 10:49:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423837880] [2024-11-16 10:49:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423837880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:58,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53336526] [2024-11-16 10:49:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:58,060 INFO L87 Difference]: Start difference. First operand 872 states and 1283 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-11-16 10:49:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:58,454 INFO L93 Difference]: Finished difference Result 1580 states and 2321 transitions. [2024-11-16 10:49:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:58,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 232 [2024-11-16 10:49:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:58,458 INFO L225 Difference]: With dead ends: 1580 [2024-11-16 10:49:58,458 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:49:58,459 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-11-16 10:49:58,459 INFO L432 NwaCegarLoop]: 1066 mSDtfsCounter, 0 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:58,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3190 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:49:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:49:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:49:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4718066743383198) internal successors, (1279), 869 states have internal predecessors, (1279), 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-11-16 10:49:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1285 transitions. [2024-11-16 10:49:58,482 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1285 transitions. Word has length 232 [2024-11-16 10:49:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1285 transitions. [2024-11-16 10:49:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-11-16 10:49:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1285 transitions. [2024-11-16 10:49:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-16 10:49:58,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:58,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:58,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 10:49:58,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash -424010507, now seen corresponding path program 1 times [2024-11-16 10:49:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476257068] [2024-11-16 10:49:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:49:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:49:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:49:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:49:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476257068] [2024-11-16 10:49:59,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476257068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:59,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093602796] [2024-11-16 10:49:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:59,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:59,077 INFO L87 Difference]: Start difference. First operand 874 states and 1285 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-11-16 10:49:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:59,512 INFO L93 Difference]: Finished difference Result 1582 states and 2322 transitions. [2024-11-16 10:49:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:59,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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 233 [2024-11-16 10:49:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:59,515 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:49:59,516 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:49:59,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-16 10:49:59,518 INFO L432 NwaCegarLoop]: 1034 mSDtfsCounter, 1139 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:59,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 2070 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:49:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:49:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:49:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4706559263521288) internal successors, (1278), 869 states have internal predecessors, (1278), 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-11-16 10:49:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1284 transitions. [2024-11-16 10:49:59,541 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1284 transitions. Word has length 233 [2024-11-16 10:49:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1284 transitions. [2024-11-16 10:49:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-11-16 10:49:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1284 transitions. [2024-11-16 10:49:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-16 10:49:59,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:59,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:49:59,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 10:49:59,547 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash -738277430, now seen corresponding path program 1 times [2024-11-16 10:49:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:59,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961916874] [2024-11-16 10:49:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:00,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961916874] [2024-11-16 10:50:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961916874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020764843] [2024-11-16 10:50:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:00,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:00,159 INFO L87 Difference]: Start difference. First operand 874 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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-11-16 10:50:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:00,658 INFO L93 Difference]: Finished difference Result 1584 states and 2322 transitions. [2024-11-16 10:50:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:00,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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 234 [2024-11-16 10:50:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:00,664 INFO L225 Difference]: With dead ends: 1584 [2024-11-16 10:50:00,664 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:00,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-16 10:50:00,665 INFO L432 NwaCegarLoop]: 1061 mSDtfsCounter, 1142 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:00,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 3160 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4695051783659379) internal successors, (1277), 869 states have internal predecessors, (1277), 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-11-16 10:50:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1283 transitions. [2024-11-16 10:50:00,680 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1283 transitions. Word has length 234 [2024-11-16 10:50:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1283 transitions. [2024-11-16 10:50:00,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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-11-16 10:50:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1283 transitions. [2024-11-16 10:50:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-16 10:50:00,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:00,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:00,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 10:50:00,683 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:00,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1289592262, now seen corresponding path program 1 times [2024-11-16 10:50:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482081140] [2024-11-16 10:50:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:01,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482081140] [2024-11-16 10:50:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482081140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:01,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237200349] [2024-11-16 10:50:01,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:01,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:01,108 INFO L87 Difference]: Start difference. First operand 874 states and 1283 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-11-16 10:50:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:01,546 INFO L93 Difference]: Finished difference Result 1582 states and 2318 transitions. [2024-11-16 10:50:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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 235 [2024-11-16 10:50:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:01,550 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:01,550 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:01,551 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-11-16 10:50:01,552 INFO L432 NwaCegarLoop]: 1034 mSDtfsCounter, 2395 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:01,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 2070 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4683544303797469) internal successors, (1276), 869 states have internal predecessors, (1276), 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-11-16 10:50:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1282 transitions. [2024-11-16 10:50:01,567 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1282 transitions. Word has length 235 [2024-11-16 10:50:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:01,567 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1282 transitions. [2024-11-16 10:50:01,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-11-16 10:50:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1282 transitions. [2024-11-16 10:50:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-16 10:50:01,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:01,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:01,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 10:50:01,570 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:01,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1888318550, now seen corresponding path program 1 times [2024-11-16 10:50:01,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091541971] [2024-11-16 10:50:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091541971] [2024-11-16 10:50:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091541971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396574455] [2024-11-16 10:50:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:02,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:02,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:02,043 INFO L87 Difference]: Start difference. First operand 874 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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-11-16 10:50:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:02,439 INFO L93 Difference]: Finished difference Result 1582 states and 2316 transitions. [2024-11-16 10:50:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:02,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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 236 [2024-11-16 10:50:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:02,443 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:02,443 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:02,444 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-11-16 10:50:02,445 INFO L432 NwaCegarLoop]: 1034 mSDtfsCounter, 2387 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:02,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 2070 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.467203682393556) internal successors, (1275), 869 states have internal predecessors, (1275), 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-11-16 10:50:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1281 transitions. [2024-11-16 10:50:02,460 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1281 transitions. Word has length 236 [2024-11-16 10:50:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1281 transitions. [2024-11-16 10:50:02,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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-11-16 10:50:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1281 transitions. [2024-11-16 10:50:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-16 10:50:02,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:02,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:02,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 10:50:02,464 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1141682689, now seen corresponding path program 1 times [2024-11-16 10:50:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619492274] [2024-11-16 10:50:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619492274] [2024-11-16 10:50:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619492274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497564835] [2024-11-16 10:50:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:03,045 INFO L87 Difference]: Start difference. First operand 874 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-11-16 10:50:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:03,541 INFO L93 Difference]: Finished difference Result 1582 states and 2314 transitions. [2024-11-16 10:50:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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 237 [2024-11-16 10:50:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:03,544 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:03,544 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:03,545 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-11-16 10:50:03,546 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 1111 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:03,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1998 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4660529344073647) internal successors, (1274), 869 states have internal predecessors, (1274), 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-11-16 10:50:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1280 transitions. [2024-11-16 10:50:03,561 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1280 transitions. Word has length 237 [2024-11-16 10:50:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:03,561 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1280 transitions. [2024-11-16 10:50:03,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-11-16 10:50:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1280 transitions. [2024-11-16 10:50:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-16 10:50:03,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:03,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:03,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 10:50:03,563 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:03,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:03,564 INFO L85 PathProgramCache]: Analyzing trace with hash -348954254, now seen corresponding path program 1 times [2024-11-16 10:50:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:03,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223034776] [2024-11-16 10:50:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:03,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223034776] [2024-11-16 10:50:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223034776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:03,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:03,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:03,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188263866] [2024-11-16 10:50:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:03,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:03,986 INFO L87 Difference]: Start difference. First operand 874 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-11-16 10:50:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:04,539 INFO L93 Difference]: Finished difference Result 1596 states and 2332 transitions. [2024-11-16 10:50:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:04,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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 238 [2024-11-16 10:50:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:04,542 INFO L225 Difference]: With dead ends: 1596 [2024-11-16 10:50:04,542 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:04,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-16 10:50:04,544 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1138 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:04,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 3104 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4649021864211738) internal successors, (1273), 869 states have internal predecessors, (1273), 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-11-16 10:50:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1279 transitions. [2024-11-16 10:50:04,557 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1279 transitions. Word has length 238 [2024-11-16 10:50:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:04,557 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1279 transitions. [2024-11-16 10:50:04,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-11-16 10:50:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1279 transitions. [2024-11-16 10:50:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-16 10:50:04,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:04,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:04,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 10:50:04,560 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:04,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash -299902942, now seen corresponding path program 1 times [2024-11-16 10:50:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301794866] [2024-11-16 10:50:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301794866] [2024-11-16 10:50:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301794866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863644646] [2024-11-16 10:50:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:04,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:04,970 INFO L87 Difference]: Start difference. First operand 874 states and 1279 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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-11-16 10:50:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:05,385 INFO L93 Difference]: Finished difference Result 1582 states and 2310 transitions. [2024-11-16 10:50:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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 239 [2024-11-16 10:50:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:05,388 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:05,388 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:05,389 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-11-16 10:50:05,390 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 2381 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:05,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 1998 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4637514384349828) internal successors, (1272), 869 states have internal predecessors, (1272), 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-11-16 10:50:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1278 transitions. [2024-11-16 10:50:05,405 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1278 transitions. Word has length 239 [2024-11-16 10:50:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1278 transitions. [2024-11-16 10:50:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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-11-16 10:50:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1278 transitions. [2024-11-16 10:50:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-16 10:50:05,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:05,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 10:50:05,408 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 876337101, now seen corresponding path program 1 times [2024-11-16 10:50:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532946774] [2024-11-16 10:50:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532946774] [2024-11-16 10:50:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532946774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:05,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796005137] [2024-11-16 10:50:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:05,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:05,849 INFO L87 Difference]: Start difference. First operand 874 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11-16 10:50:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:06,256 INFO L93 Difference]: Finished difference Result 1582 states and 2308 transitions. [2024-11-16 10:50:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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 240 [2024-11-16 10:50:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:06,259 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:06,259 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:06,260 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-11-16 10:50:06,260 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 2373 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:06,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1998 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4626006904487918) internal successors, (1271), 869 states have internal predecessors, (1271), 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-11-16 10:50:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1277 transitions. [2024-11-16 10:50:06,282 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1277 transitions. Word has length 240 [2024-11-16 10:50:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:06,282 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1277 transitions. [2024-11-16 10:50:06,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11-16 10:50:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1277 transitions. [2024-11-16 10:50:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-16 10:50:06,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:06,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:06,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 10:50:06,285 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 271304861, now seen corresponding path program 1 times [2024-11-16 10:50:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230419787] [2024-11-16 10:50:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,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-11-16 10:50:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230419787] [2024-11-16 10:50:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230419787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:06,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:06,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527452738] [2024-11-16 10:50:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:06,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:06,767 INFO L87 Difference]: Start difference. First operand 874 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-11-16 10:50:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:07,170 INFO L93 Difference]: Finished difference Result 1582 states and 2306 transitions. [2024-11-16 10:50:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:07,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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 241 [2024-11-16 10:50:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:07,173 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:07,173 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:07,174 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-11-16 10:50:07,174 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 1255 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:07,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 2005 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4614499424626006) internal successors, (1270), 869 states have internal predecessors, (1270), 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-11-16 10:50:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1276 transitions. [2024-11-16 10:50:07,196 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1276 transitions. Word has length 241 [2024-11-16 10:50:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:07,197 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1276 transitions. [2024-11-16 10:50:07,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-11-16 10:50:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1276 transitions. [2024-11-16 10:50:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-16 10:50:07,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:07,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:07,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 10:50:07,199 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:07,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 909113256, now seen corresponding path program 1 times [2024-11-16 10:50:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019853683] [2024-11-16 10:50:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:07,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:07,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019853683] [2024-11-16 10:50:07,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019853683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:07,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:07,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387650338] [2024-11-16 10:50:07,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:07,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:07,666 INFO L87 Difference]: Start difference. First operand 874 states and 1276 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11-16 10:50:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:08,017 INFO L93 Difference]: Finished difference Result 1582 states and 2304 transitions. [2024-11-16 10:50:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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 242 [2024-11-16 10:50:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:08,019 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:08,019 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:08,021 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-11-16 10:50:08,021 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 1251 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:08,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2005 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:50:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4602991944764097) internal successors, (1269), 869 states have internal predecessors, (1269), 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-11-16 10:50:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1275 transitions. [2024-11-16 10:50:08,037 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1275 transitions. Word has length 242 [2024-11-16 10:50:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:08,037 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1275 transitions. [2024-11-16 10:50:08,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11-16 10:50:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1275 transitions. [2024-11-16 10:50:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-16 10:50:08,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:08,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:08,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 10:50:08,040 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:08,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1049979544, now seen corresponding path program 1 times [2024-11-16 10:50:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:08,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238401114] [2024-11-16 10:50:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:08,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:08,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238401114] [2024-11-16 10:50:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238401114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366344530] [2024-11-16 10:50:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:08,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:08,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:08,614 INFO L87 Difference]: Start difference. First operand 874 states and 1275 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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-11-16 10:50:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:09,095 INFO L93 Difference]: Finished difference Result 1582 states and 2302 transitions. [2024-11-16 10:50:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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 243 [2024-11-16 10:50:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:09,098 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:09,098 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:09,100 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-11-16 10:50:09,101 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 2349 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:09,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 1998 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4591484464902187) internal successors, (1268), 869 states have internal predecessors, (1268), 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-11-16 10:50:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1274 transitions. [2024-11-16 10:50:09,120 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1274 transitions. Word has length 243 [2024-11-16 10:50:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:09,120 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1274 transitions. [2024-11-16 10:50:09,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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-11-16 10:50:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1274 transitions. [2024-11-16 10:50:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-16 10:50:09,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:09,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:09,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 10:50:09,124 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:09,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 207585539, now seen corresponding path program 1 times [2024-11-16 10:50:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:09,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757373555] [2024-11-16 10:50:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:09,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-11-16 10:50:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:09,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757373555] [2024-11-16 10:50:09,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757373555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:09,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:09,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795887777] [2024-11-16 10:50:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:09,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:09,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:09,627 INFO L87 Difference]: Start difference. First operand 874 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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-11-16 10:50:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:10,075 INFO L93 Difference]: Finished difference Result 1582 states and 2300 transitions. [2024-11-16 10:50:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:10,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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 244 [2024-11-16 10:50:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:10,079 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:10,079 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:10,081 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-11-16 10:50:10,081 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 2341 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:10,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 1998 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4579976985040277) internal successors, (1267), 869 states have internal predecessors, (1267), 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-11-16 10:50:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1273 transitions. [2024-11-16 10:50:10,097 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1273 transitions. Word has length 244 [2024-11-16 10:50:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:10,098 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1273 transitions. [2024-11-16 10:50:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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-11-16 10:50:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1273 transitions. [2024-11-16 10:50:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-16 10:50:10,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:10,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 10:50:10,100 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1764590061, now seen corresponding path program 1 times [2024-11-16 10:50:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398784238] [2024-11-16 10:50:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398784238] [2024-11-16 10:50:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398784238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334172844] [2024-11-16 10:50:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:10,657 INFO L87 Difference]: Start difference. First operand 874 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-11-16 10:50:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:10,981 INFO L93 Difference]: Finished difference Result 1582 states and 2298 transitions. [2024-11-16 10:50:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:10,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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 245 [2024-11-16 10:50:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:10,983 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:10,983 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:10,984 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-11-16 10:50:10,984 INFO L432 NwaCegarLoop]: 1038 mSDtfsCounter, 1132 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:10,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 2078 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:50:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4556962025316456) internal successors, (1265), 869 states have internal predecessors, (1265), 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-11-16 10:50:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1271 transitions. [2024-11-16 10:50:11,000 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1271 transitions. Word has length 245 [2024-11-16 10:50:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:11,001 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1271 transitions. [2024-11-16 10:50:11,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-11-16 10:50:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1271 transitions. [2024-11-16 10:50:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-16 10:50:11,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:11,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:11,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 10:50:11,003 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash -53458225, now seen corresponding path program 1 times [2024-11-16 10:50:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416322110] [2024-11-16 10:50:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416322110] [2024-11-16 10:50:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416322110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948417620] [2024-11-16 10:50:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:11,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:11,474 INFO L87 Difference]: Start difference. First operand 874 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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-11-16 10:50:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:11,861 INFO L93 Difference]: Finished difference Result 1582 states and 2294 transitions. [2024-11-16 10:50:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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 247 [2024-11-16 10:50:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:11,863 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:11,863 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:11,864 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-11-16 10:50:11,864 INFO L432 NwaCegarLoop]: 1038 mSDtfsCounter, 2379 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:11,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2382 Valid, 2078 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4545454545454546) internal successors, (1264), 869 states have internal predecessors, (1264), 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-11-16 10:50:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1270 transitions. [2024-11-16 10:50:11,880 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1270 transitions. Word has length 247 [2024-11-16 10:50:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:11,881 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1270 transitions. [2024-11-16 10:50:11,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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-11-16 10:50:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1270 transitions. [2024-11-16 10:50:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-16 10:50:11,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:11,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 10:50:11,884 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -127200798, now seen corresponding path program 1 times [2024-11-16 10:50:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761835011] [2024-11-16 10:50:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 10:50:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 10:50:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,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-11-16 10:50:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761835011] [2024-11-16 10:50:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761835011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313925447] [2024-11-16 10:50:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:12,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:12,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:12,383 INFO L87 Difference]: Start difference. First operand 874 states and 1270 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-11-16 10:50:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:12,739 INFO L93 Difference]: Finished difference Result 1582 states and 2292 transitions. [2024-11-16 10:50:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:12,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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 248 [2024-11-16 10:50:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:12,741 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:12,741 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:12,741 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-11-16 10:50:12,742 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 1167 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:12,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 2082 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:50:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4533947065592636) internal successors, (1263), 869 states have internal predecessors, (1263), 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-11-16 10:50:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1269 transitions. [2024-11-16 10:50:12,756 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1269 transitions. Word has length 248 [2024-11-16 10:50:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:12,757 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1269 transitions. [2024-11-16 10:50:12,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-11-16 10:50:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1269 transitions. [2024-11-16 10:50:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-16 10:50:12,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:12,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:12,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 10:50:12,759 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:12,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1971357637, now seen corresponding path program 1 times [2024-11-16 10:50:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047757737] [2024-11-16 10:50:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047757737] [2024-11-16 10:50:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047757737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379897247] [2024-11-16 10:50:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:13,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:13,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:13,608 INFO L87 Difference]: Start difference. First operand 874 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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-11-16 10:50:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:14,194 INFO L93 Difference]: Finished difference Result 1582 states and 2290 transitions. [2024-11-16 10:50:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:14,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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 249 [2024-11-16 10:50:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:14,196 INFO L225 Difference]: With dead ends: 1582 [2024-11-16 10:50:14,196 INFO L226 Difference]: Without dead ends: 874 [2024-11-16 10:50:14,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:14,197 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1085 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:14,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 2811 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:50:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-16 10:50:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-16 10:50:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4522439585730724) internal successors, (1262), 869 states have internal predecessors, (1262), 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-11-16 10:50:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1268 transitions. [2024-11-16 10:50:14,212 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1268 transitions. Word has length 249 [2024-11-16 10:50:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:14,212 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1268 transitions. [2024-11-16 10:50:14,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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-11-16 10:50:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1268 transitions. [2024-11-16 10:50:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-16 10:50:14,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:14,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:14,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 10:50:14,215 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:14,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash 521713451, now seen corresponding path program 1 times [2024-11-16 10:50:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:14,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781967052] [2024-11-16 10:50:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781967052] [2024-11-16 10:50:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781967052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:15,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123872430] [2024-11-16 10:50:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:15,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:15,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:15,201 INFO L87 Difference]: Start difference. First operand 874 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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-11-16 10:50:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:15,770 INFO L93 Difference]: Finished difference Result 1588 states and 2296 transitions. [2024-11-16 10:50:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:15,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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 250 [2024-11-16 10:50:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:15,773 INFO L225 Difference]: With dead ends: 1588 [2024-11-16 10:50:15,774 INFO L226 Difference]: Without dead ends: 878 [2024-11-16 10:50:15,775 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-11-16 10:50:15,775 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 2 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:15,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3965 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-16 10:50:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2024-11-16 10:50:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4512055109070034) internal successors, (1264), 871 states have internal predecessors, (1264), 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-11-16 10:50:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1270 transitions. [2024-11-16 10:50:15,792 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1270 transitions. Word has length 250 [2024-11-16 10:50:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:15,792 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1270 transitions. [2024-11-16 10:50:15,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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-11-16 10:50:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1270 transitions. [2024-11-16 10:50:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-16 10:50:15,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:15,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:15,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-16 10:50:15,794 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:15,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 333118819, now seen corresponding path program 1 times [2024-11-16 10:50:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140906847] [2024-11-16 10:50:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140906847] [2024-11-16 10:50:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140906847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120027364] [2024-11-16 10:50:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:16,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:16,588 INFO L87 Difference]: Start difference. First operand 876 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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-11-16 10:50:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:17,173 INFO L93 Difference]: Finished difference Result 1586 states and 2292 transitions. [2024-11-16 10:50:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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 251 [2024-11-16 10:50:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:17,175 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:17,175 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:17,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:17,176 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1081 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:17,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1885 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4500574052812858) internal successors, (1263), 871 states have internal predecessors, (1263), 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-11-16 10:50:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1269 transitions. [2024-11-16 10:50:17,195 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1269 transitions. Word has length 251 [2024-11-16 10:50:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:17,195 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1269 transitions. [2024-11-16 10:50:17,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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-11-16 10:50:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1269 transitions. [2024-11-16 10:50:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-16 10:50:17,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:17,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:17,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-16 10:50:17,198 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:17,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash 320338256, now seen corresponding path program 1 times [2024-11-16 10:50:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434993088] [2024-11-16 10:50:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:17,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:17,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434993088] [2024-11-16 10:50:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434993088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449073748] [2024-11-16 10:50:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:17,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:17,869 INFO L87 Difference]: Start difference. First operand 876 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-11-16 10:50:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:18,433 INFO L93 Difference]: Finished difference Result 1586 states and 2290 transitions. [2024-11-16 10:50:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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 252 [2024-11-16 10:50:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:18,435 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:18,435 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:18,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:18,437 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 2152 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:18,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1878 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4489092996555684) internal successors, (1262), 871 states have internal predecessors, (1262), 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-11-16 10:50:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1268 transitions. [2024-11-16 10:50:18,453 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1268 transitions. Word has length 252 [2024-11-16 10:50:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1268 transitions. [2024-11-16 10:50:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-11-16 10:50:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1268 transitions. [2024-11-16 10:50:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-16 10:50:18,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:18,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:18,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 10:50:18,457 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:18,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash 231143173, now seen corresponding path program 1 times [2024-11-16 10:50:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:18,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529884430] [2024-11-16 10:50:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529884430] [2024-11-16 10:50:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529884430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492361458] [2024-11-16 10:50:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:19,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:19,066 INFO L87 Difference]: Start difference. First operand 876 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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-11-16 10:50:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:19,534 INFO L93 Difference]: Finished difference Result 1586 states and 2288 transitions. [2024-11-16 10:50:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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 253 [2024-11-16 10:50:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:19,537 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:19,537 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:19,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:19,538 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1079 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:19,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1885 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4477611940298507) internal successors, (1261), 871 states have internal predecessors, (1261), 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-11-16 10:50:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1267 transitions. [2024-11-16 10:50:19,554 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1267 transitions. Word has length 253 [2024-11-16 10:50:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1267 transitions. [2024-11-16 10:50:19,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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-11-16 10:50:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1267 transitions. [2024-11-16 10:50:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-16 10:50:19,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:19,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:19,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-16 10:50:19,557 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:19,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 31332527, now seen corresponding path program 1 times [2024-11-16 10:50:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898314398] [2024-11-16 10:50:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:20,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:20,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:20,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:20,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898314398] [2024-11-16 10:50:20,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898314398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:20,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:20,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:20,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353633835] [2024-11-16 10:50:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:20,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:20,216 INFO L87 Difference]: Start difference. First operand 876 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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-11-16 10:50:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:20,736 INFO L93 Difference]: Finished difference Result 1586 states and 2286 transitions. [2024-11-16 10:50:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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 254 [2024-11-16 10:50:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:20,738 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:20,738 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:20,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:20,740 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1078 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:20,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1885 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4466130884041333) internal successors, (1260), 871 states have internal predecessors, (1260), 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-11-16 10:50:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1266 transitions. [2024-11-16 10:50:20,761 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1266 transitions. Word has length 254 [2024-11-16 10:50:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1266 transitions. [2024-11-16 10:50:20,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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-11-16 10:50:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1266 transitions. [2024-11-16 10:50:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-16 10:50:20,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:20,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:20,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-16 10:50:20,768 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1403012183, now seen corresponding path program 1 times [2024-11-16 10:50:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:20,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315237574] [2024-11-16 10:50:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315237574] [2024-11-16 10:50:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315237574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:21,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338721338] [2024-11-16 10:50:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:21,489 INFO L87 Difference]: Start difference. First operand 876 states and 1266 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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-11-16 10:50:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:22,001 INFO L93 Difference]: Finished difference Result 1586 states and 2284 transitions. [2024-11-16 10:50:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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 255 [2024-11-16 10:50:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:22,004 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:22,004 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:22,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:22,007 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1077 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:22,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1885 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:50:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4454649827784156) internal successors, (1259), 871 states have internal predecessors, (1259), 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-11-16 10:50:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1265 transitions. [2024-11-16 10:50:22,023 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1265 transitions. Word has length 255 [2024-11-16 10:50:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:22,024 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1265 transitions. [2024-11-16 10:50:22,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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-11-16 10:50:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1265 transitions. [2024-11-16 10:50:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-16 10:50:22,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:22,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:22,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-16 10:50:22,026 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2117861542, now seen corresponding path program 1 times [2024-11-16 10:50:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006750622] [2024-11-16 10:50:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006750622] [2024-11-16 10:50:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006750622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152363176] [2024-11-16 10:50:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:22,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:22,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:22,700 INFO L87 Difference]: Start difference. First operand 876 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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-11-16 10:50:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:23,324 INFO L93 Difference]: Finished difference Result 1586 states and 2282 transitions. [2024-11-16 10:50:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:23,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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 256 [2024-11-16 10:50:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:23,327 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:23,327 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:23,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:23,328 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 2128 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:23,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 1878 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:50:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.444316877152698) internal successors, (1258), 871 states have internal predecessors, (1258), 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-11-16 10:50:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1264 transitions. [2024-11-16 10:50:23,346 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1264 transitions. Word has length 256 [2024-11-16 10:50:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:23,348 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1264 transitions. [2024-11-16 10:50:23,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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-11-16 10:50:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1264 transitions. [2024-11-16 10:50:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-16 10:50:23,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:23,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:23,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-16 10:50:23,350 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:23,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -822000167, now seen corresponding path program 1 times [2024-11-16 10:50:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:23,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533944898] [2024-11-16 10:50:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:23,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:23,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533944898] [2024-11-16 10:50:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533944898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:23,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:23,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459791829] [2024-11-16 10:50:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:23,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:23,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:23,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:23,930 INFO L87 Difference]: Start difference. First operand 876 states and 1264 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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-11-16 10:50:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:24,379 INFO L93 Difference]: Finished difference Result 1586 states and 2280 transitions. [2024-11-16 10:50:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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 257 [2024-11-16 10:50:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:24,381 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:24,381 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:24,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:24,382 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1075 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:24,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1885 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4431687715269805) internal successors, (1257), 871 states have internal predecessors, (1257), 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-11-16 10:50:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1263 transitions. [2024-11-16 10:50:24,397 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1263 transitions. Word has length 257 [2024-11-16 10:50:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:24,397 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1263 transitions. [2024-11-16 10:50:24,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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-11-16 10:50:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1263 transitions. [2024-11-16 10:50:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-16 10:50:24,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:24,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:24,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-16 10:50:24,400 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:24,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1776357389, now seen corresponding path program 1 times [2024-11-16 10:50:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661194320] [2024-11-16 10:50:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661194320] [2024-11-16 10:50:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661194320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804983655] [2024-11-16 10:50:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:24,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:24,927 INFO L87 Difference]: Start difference. First operand 876 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-11-16 10:50:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:25,401 INFO L93 Difference]: Finished difference Result 1586 states and 2278 transitions. [2024-11-16 10:50:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:25,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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 258 [2024-11-16 10:50:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:25,404 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:25,404 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:25,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:25,406 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1074 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:25,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1885 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4420206659012629) internal successors, (1256), 871 states have internal predecessors, (1256), 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-11-16 10:50:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1262 transitions. [2024-11-16 10:50:25,419 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1262 transitions. Word has length 258 [2024-11-16 10:50:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:25,423 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1262 transitions. [2024-11-16 10:50:25,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-11-16 10:50:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1262 transitions. [2024-11-16 10:50:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-16 10:50:25,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:25,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-16 10:50:25,425 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1800794773, now seen corresponding path program 1 times [2024-11-16 10:50:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413184264] [2024-11-16 10:50:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413184264] [2024-11-16 10:50:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413184264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:26,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:26,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932356228] [2024-11-16 10:50:26,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:26,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:26,132 INFO L87 Difference]: Start difference. First operand 876 states and 1262 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-11-16 10:50:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:26,591 INFO L93 Difference]: Finished difference Result 1586 states and 2276 transitions. [2024-11-16 10:50:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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 259 [2024-11-16 10:50:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:26,593 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:26,593 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:26,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:26,594 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 2110 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:26,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 1878 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4408725602755454) internal successors, (1255), 871 states have internal predecessors, (1255), 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-11-16 10:50:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1261 transitions. [2024-11-16 10:50:26,610 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1261 transitions. Word has length 259 [2024-11-16 10:50:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:26,610 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1261 transitions. [2024-11-16 10:50:26,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-11-16 10:50:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1261 transitions. [2024-11-16 10:50:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-16 10:50:26,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:26,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-16 10:50:26,613 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1385443096, now seen corresponding path program 1 times [2024-11-16 10:50:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925871270] [2024-11-16 10:50:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:27,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:27,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:27,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925871270] [2024-11-16 10:50:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925871270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836176739] [2024-11-16 10:50:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:27,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:27,149 INFO L87 Difference]: Start difference. First operand 876 states and 1261 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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-11-16 10:50:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:27,606 INFO L93 Difference]: Finished difference Result 1586 states and 2274 transitions. [2024-11-16 10:50:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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 260 [2024-11-16 10:50:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:27,608 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:27,608 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:27,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:27,610 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 2104 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2104 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:27,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2104 Valid, 1878 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4397244546498278) internal successors, (1254), 871 states have internal predecessors, (1254), 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-11-16 10:50:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1260 transitions. [2024-11-16 10:50:27,625 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1260 transitions. Word has length 260 [2024-11-16 10:50:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1260 transitions. [2024-11-16 10:50:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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-11-16 10:50:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1260 transitions. [2024-11-16 10:50:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-16 10:50:27,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:27,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:27,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-16 10:50:27,627 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1331540825, now seen corresponding path program 1 times [2024-11-16 10:50:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40033211] [2024-11-16 10:50:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40033211] [2024-11-16 10:50:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40033211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269292021] [2024-11-16 10:50:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:28,178 INFO L87 Difference]: Start difference. First operand 876 states and 1260 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-11-16 10:50:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:28,646 INFO L93 Difference]: Finished difference Result 1586 states and 2272 transitions. [2024-11-16 10:50:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:28,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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 261 [2024-11-16 10:50:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:28,648 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:28,648 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:28,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:28,649 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 2098 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:28,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 1878 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4385763490241101) internal successors, (1253), 871 states have internal predecessors, (1253), 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-11-16 10:50:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1259 transitions. [2024-11-16 10:50:28,662 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1259 transitions. Word has length 261 [2024-11-16 10:50:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:28,663 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1259 transitions. [2024-11-16 10:50:28,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-11-16 10:50:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1259 transitions. [2024-11-16 10:50:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-16 10:50:28,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:28,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-16 10:50:28,665 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1980918886, now seen corresponding path program 1 times [2024-11-16 10:50:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489175739] [2024-11-16 10:50:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 10:50:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 10:50:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 10:50:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:50:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:29,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489175739] [2024-11-16 10:50:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489175739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:29,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816037050] [2024-11-16 10:50:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:29,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:29,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:29,235 INFO L87 Difference]: Start difference. First operand 876 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-11-16 10:50:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:29,687 INFO L93 Difference]: Finished difference Result 1586 states and 2270 transitions. [2024-11-16 10:50:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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 262 [2024-11-16 10:50:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:29,689 INFO L225 Difference]: With dead ends: 1586 [2024-11-16 10:50:29,689 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 10:50:29,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-16 10:50:29,690 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 2092 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:29,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 1878 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 10:50:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-16 10:50:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4374282433983927) internal successors, (1252), 871 states have internal predecessors, (1252), 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-11-16 10:50:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1258 transitions. [2024-11-16 10:50:29,703 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1258 transitions. Word has length 262 [2024-11-16 10:50:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:29,703 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1258 transitions. [2024-11-16 10:50:29,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-11-16 10:50:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1258 transitions. [2024-11-16 10:50:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-16 10:50:29,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:29,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:50:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-16 10:50:29,705 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:29,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash 587899266, now seen corresponding path program 1 times [2024-11-16 10:50:29,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:29,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487911142] [2024-11-16 10:50:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms