./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/eca-rers2012/Problem16_label25.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:46:52,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:46:52,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:46:52,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:46:52,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:46:52,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:46:52,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:46:52,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:46:52,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:46:52,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:46:52,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:46:52,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:46:52,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:46:52,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:46:52,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:46:52,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:46:52,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:46:52,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:46:52,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:46:52,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:46:52,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:46:52,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:46:52,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:46:52,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:46:52,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:46:52,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:46:52,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:46:52,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:46:52,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:46:52,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:46:52,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:46:52,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:46:52,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:46:52,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:46:52,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:46:52,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:46:52,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:46:52,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:46:52,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:46:52,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:46:52,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:46:52,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:46:52,448 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 [2024-11-09 19:46:52,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:46:52,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:46:52,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:46:52,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:46:52,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:46:52,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-11-09 19:46:54,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:46:54,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:46:54,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-11-09 19:46:54,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd3accbbc/2b3aa72f46004f8190072243519b4665/FLAG8a2e5685b [2024-11-09 19:46:54,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd3accbbc/2b3aa72f46004f8190072243519b4665 [2024-11-09 19:46:54,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:46:54,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:46:54,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:46:54,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:46:54,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:46:54,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:46:54" (1/1) ... [2024-11-09 19:46:54,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15227c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:54, skipping insertion in model container [2024-11-09 19:46:54,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:46:54" (1/1) ... [2024-11-09 19:46:54,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:46:55,172 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/eca-rers2012/Problem16_label25.c[5318,5331] [2024-11-09 19:46:55,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:46:55,525 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:46:55,547 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/eca-rers2012/Problem16_label25.c[5318,5331] [2024-11-09 19:46:55,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:46:55,791 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:46:55,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55 WrapperNode [2024-11-09 19:46:55,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:46:55,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:46:55,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:46:55,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:46:55,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:55,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:55,942 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1769 [2024-11-09 19:46:55,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:46:55,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:46:55,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:46:55,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:46:55,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:55,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:55,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,033 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-09 19:46:56,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:46:56,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:46:56,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:46:56,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:46:56,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (1/1) ... [2024-11-09 19:46:56,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:46:56,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:46:56,194 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-09 19:46:56,200 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-09 19:46:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:46:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:46:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:46:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:46:56,371 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:46:56,374 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:46:58,901 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2024-11-09 19:46:59,054 INFO L? ?]: Removed 757 outVars from TransFormulas that were not future-live. [2024-11-09 19:46:59,055 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:46:59,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:46:59,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:46:59,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:46:59 BoogieIcfgContainer [2024-11-09 19:46:59,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:46:59,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:46:59,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:46:59,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:46:59,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:46:54" (1/3) ... [2024-11-09 19:46:59,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2991d191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:46:59, skipping insertion in model container [2024-11-09 19:46:59,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:55" (2/3) ... [2024-11-09 19:46:59,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2991d191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:46:59, skipping insertion in model container [2024-11-09 19:46:59,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:46:59" (3/3) ... [2024-11-09 19:46:59,099 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label25.c [2024-11-09 19:46:59,117 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:46:59,118 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:46:59,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:46:59,208 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;@55aed5ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:46:59,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:46:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 397 states have (on average 2.4886649874055418) internal successors, (988), 398 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:46:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 19:46:59,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:46:59,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:46:59,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:46:59,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:46:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash -619675466, now seen corresponding path program 1 times [2024-11-09 19:46:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:46:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033025273] [2024-11-09 19:46:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:46:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:46:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:46:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:46:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:46:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033025273] [2024-11-09 19:46:59,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033025273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:46:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:46:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:46:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398889156] [2024-11-09 19:46:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:46:59,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:46:59,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:46:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:46:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:46:59,681 INFO L87 Difference]: Start difference. First operand has 399 states, 397 states have (on average 2.4886649874055418) internal successors, (988), 398 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:02,030 INFO L93 Difference]: Finished difference Result 1128 states and 2895 transitions. [2024-11-09 19:47:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:02,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 19:47:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:02,048 INFO L225 Difference]: With dead ends: 1128 [2024-11-09 19:47:02,049 INFO L226 Difference]: Without dead ends: 665 [2024-11-09 19:47:02,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:02,057 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 599 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:02,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 258 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:47:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-09 19:47:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2024-11-09 19:47:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 2.305722891566265) internal successors, (1531), 664 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1531 transitions. [2024-11-09 19:47:02,141 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1531 transitions. Word has length 52 [2024-11-09 19:47:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1531 transitions. [2024-11-09 19:47:02,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1531 transitions. [2024-11-09 19:47:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 19:47:02,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:02,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:02,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:47:02,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2088156932, now seen corresponding path program 1 times [2024-11-09 19:47:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:02,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403177333] [2024-11-09 19:47:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:47:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:02,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403177333] [2024-11-09 19:47:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403177333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:02,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:47:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614559888] [2024-11-09 19:47:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:02,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:02,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:02,456 INFO L87 Difference]: Start difference. First operand 665 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:04,244 INFO L93 Difference]: Finished difference Result 1988 states and 4587 transitions. [2024-11-09 19:47:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-11-09 19:47:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:04,251 INFO L225 Difference]: With dead ends: 1988 [2024-11-09 19:47:04,251 INFO L226 Difference]: Without dead ends: 1325 [2024-11-09 19:47:04,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:04,258 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 643 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:04,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 158 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:47:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-09 19:47:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2024-11-09 19:47:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 2.1646525679758306) internal successors, (2866), 1324 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2866 transitions. [2024-11-09 19:47:04,321 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2866 transitions. Word has length 121 [2024-11-09 19:47:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:04,322 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 2866 transitions. [2024-11-09 19:47:04,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2866 transitions. [2024-11-09 19:47:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 19:47:04,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:04,329 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:04,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:47:04,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:04,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1668586920, now seen corresponding path program 1 times [2024-11-09 19:47:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442697812] [2024-11-09 19:47:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:47:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442697812] [2024-11-09 19:47:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442697812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:47:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679518521] [2024-11-09 19:47:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:04,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:04,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:04,622 INFO L87 Difference]: Start difference. First operand 1325 states and 2866 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:06,690 INFO L93 Difference]: Finished difference Result 3968 states and 8592 transitions. [2024-11-09 19:47:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-11-09 19:47:06,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:06,702 INFO L225 Difference]: With dead ends: 3968 [2024-11-09 19:47:06,702 INFO L226 Difference]: Without dead ends: 2645 [2024-11-09 19:47:06,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:06,705 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 514 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:06,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 83 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:47:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2024-11-09 19:47:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2024-11-09 19:47:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 2.115733736762481) internal successors, (5594), 2644 states have internal predecessors, (5594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 5594 transitions. [2024-11-09 19:47:06,760 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 5594 transitions. Word has length 149 [2024-11-09 19:47:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:06,760 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 5594 transitions. [2024-11-09 19:47:06,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 5594 transitions. [2024-11-09 19:47:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 19:47:06,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:06,765 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:06,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:47:06,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:06,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash -223260448, now seen corresponding path program 1 times [2024-11-09 19:47:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561600002] [2024-11-09 19:47:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 19:47:07,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561600002] [2024-11-09 19:47:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561600002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:47:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149915828] [2024-11-09 19:47:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:07,010 INFO L87 Difference]: Start difference. First operand 2645 states and 5594 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:08,560 INFO L93 Difference]: Finished difference Result 6608 states and 13807 transitions. [2024-11-09 19:47:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:08,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-09 19:47:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:08,576 INFO L225 Difference]: With dead ends: 6608 [2024-11-09 19:47:08,576 INFO L226 Difference]: Without dead ends: 3965 [2024-11-09 19:47:08,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:08,581 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 540 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:08,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 87 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:47:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2024-11-09 19:47:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2024-11-09 19:47:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3964 states have (on average 2.0088294651866803) internal successors, (7963), 3964 states have internal predecessors, (7963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 7963 transitions. [2024-11-09 19:47:08,659 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 7963 transitions. Word has length 251 [2024-11-09 19:47:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:08,660 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 7963 transitions. [2024-11-09 19:47:08,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 7963 transitions. [2024-11-09 19:47:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-09 19:47:08,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:08,665 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:08,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:47:08,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:08,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash 988879874, now seen corresponding path program 1 times [2024-11-09 19:47:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:08,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107208691] [2024-11-09 19:47:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:47:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107208691] [2024-11-09 19:47:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107208691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:09,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696233425] [2024-11-09 19:47:09,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:09,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:47:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:09,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:47:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:09,248 INFO L87 Difference]: Start difference. First operand 3965 states and 7963 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:11,220 INFO L93 Difference]: Finished difference Result 8258 states and 16528 transitions. [2024-11-09 19:47:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:47:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2024-11-09 19:47:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:11,238 INFO L225 Difference]: With dead ends: 8258 [2024-11-09 19:47:11,239 INFO L226 Difference]: Without dead ends: 4295 [2024-11-09 19:47:11,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 19:47:11,245 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 389 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:11,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 328 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:47:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2024-11-09 19:47:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 4295. [2024-11-09 19:47:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.9937121564974383) internal successors, (8561), 4294 states have internal predecessors, (8561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 8561 transitions. [2024-11-09 19:47:11,331 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 8561 transitions. Word has length 298 [2024-11-09 19:47:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:11,331 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 8561 transitions. [2024-11-09 19:47:11,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 8561 transitions. [2024-11-09 19:47:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-09 19:47:11,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:11,338 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:11,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:47:11,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1334978584, now seen corresponding path program 1 times [2024-11-09 19:47:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014779813] [2024-11-09 19:47:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:47:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014779813] [2024-11-09 19:47:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014779813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:47:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974942058] [2024-11-09 19:47:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:47:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:47:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:47:11,978 INFO L87 Difference]: Start difference. First operand 4295 states and 8561 transitions. Second operand has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:14,191 INFO L93 Difference]: Finished difference Result 8121 states and 16111 transitions. [2024-11-09 19:47:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:47:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2024-11-09 19:47:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:14,216 INFO L225 Difference]: With dead ends: 8121 [2024-11-09 19:47:14,217 INFO L226 Difference]: Without dead ends: 3965 [2024-11-09 19:47:14,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:47:14,224 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 573 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:14,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 296 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:47:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2024-11-09 19:47:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2024-11-09 19:47:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3964 states have (on average 1.8731079717457113) internal successors, (7425), 3964 states have internal predecessors, (7425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 7425 transitions. [2024-11-09 19:47:14,322 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 7425 transitions. Word has length 386 [2024-11-09 19:47:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:14,323 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 7425 transitions. [2024-11-09 19:47:14,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 7425 transitions. [2024-11-09 19:47:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 19:47:14,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:14,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:14,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:47:14,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:14,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1481773014, now seen corresponding path program 1 times [2024-11-09 19:47:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174041920] [2024-11-09 19:47:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 19:47:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174041920] [2024-11-09 19:47:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174041920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:14,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:14,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619113456] [2024-11-09 19:47:14,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:14,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:14,680 INFO L87 Difference]: Start difference. First operand 3965 states and 7425 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:15,998 INFO L93 Difference]: Finished difference Result 9248 states and 17426 transitions. [2024-11-09 19:47:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2024-11-09 19:47:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:16,021 INFO L225 Difference]: With dead ends: 9248 [2024-11-09 19:47:16,021 INFO L226 Difference]: Without dead ends: 5615 [2024-11-09 19:47:16,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:16,027 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 547 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:16,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 673 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:47:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2024-11-09 19:47:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 5615. [2024-11-09 19:47:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 1.8680085500534378) internal successors, (10487), 5614 states have internal predecessors, (10487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 10487 transitions. [2024-11-09 19:47:16,125 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 10487 transitions. Word has length 393 [2024-11-09 19:47:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:16,126 INFO L471 AbstractCegarLoop]: Abstraction has 5615 states and 10487 transitions. [2024-11-09 19:47:16,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 10487 transitions. [2024-11-09 19:47:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-11-09 19:47:16,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:16,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:47:16,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:16,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1961925742, now seen corresponding path program 1 times [2024-11-09 19:47:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650430185] [2024-11-09 19:47:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:16,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:47:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650430185] [2024-11-09 19:47:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650430185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:16,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139734410] [2024-11-09 19:47:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:16,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:16,416 INFO L87 Difference]: Start difference. First operand 5615 states and 10487 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:17,593 INFO L93 Difference]: Finished difference Result 10898 states and 20378 transitions. [2024-11-09 19:47:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:17,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 448 [2024-11-09 19:47:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:17,607 INFO L225 Difference]: With dead ends: 10898 [2024-11-09 19:47:17,607 INFO L226 Difference]: Without dead ends: 5615 [2024-11-09 19:47:17,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:17,614 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 453 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:17,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 63 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2024-11-09 19:47:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 5615. [2024-11-09 19:47:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 1.855183469896687) internal successors, (10415), 5614 states have internal predecessors, (10415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 10415 transitions. [2024-11-09 19:47:17,712 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 10415 transitions. Word has length 448 [2024-11-09 19:47:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:17,713 INFO L471 AbstractCegarLoop]: Abstraction has 5615 states and 10415 transitions. [2024-11-09 19:47:17,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 10415 transitions. [2024-11-09 19:47:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-11-09 19:47:17,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:17,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:17,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:47:17,724 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:17,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1065725710, now seen corresponding path program 1 times [2024-11-09 19:47:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:17,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333244100] [2024-11-09 19:47:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:47:18,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:18,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333244100] [2024-11-09 19:47:18,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333244100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:18,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646524794] [2024-11-09 19:47:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:18,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:47:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:47:18,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:18,163 INFO L87 Difference]: Start difference. First operand 5615 states and 10415 transitions. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:20,459 INFO L93 Difference]: Finished difference Result 16511 states and 30666 transitions. [2024-11-09 19:47:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:47:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2024-11-09 19:47:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:20,487 INFO L225 Difference]: With dead ends: 16511 [2024-11-09 19:47:20,487 INFO L226 Difference]: Without dead ends: 11228 [2024-11-09 19:47:20,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:20,496 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 720 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:20,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 95 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:47:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11228 states. [2024-11-09 19:47:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11228 to 10895. [2024-11-09 19:47:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10895 states, 10894 states have (on average 1.852762988801175) internal successors, (20184), 10894 states have internal predecessors, (20184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10895 states to 10895 states and 20184 transitions. [2024-11-09 19:47:20,677 INFO L78 Accepts]: Start accepts. Automaton has 10895 states and 20184 transitions. Word has length 532 [2024-11-09 19:47:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:20,677 INFO L471 AbstractCegarLoop]: Abstraction has 10895 states and 20184 transitions. [2024-11-09 19:47:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10895 states and 20184 transitions. [2024-11-09 19:47:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2024-11-09 19:47:20,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:20,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:20,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:47:20,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:20,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash -12220316, now seen corresponding path program 1 times [2024-11-09 19:47:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967107688] [2024-11-09 19:47:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 19:47:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967107688] [2024-11-09 19:47:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967107688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:21,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:21,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:21,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044895930] [2024-11-09 19:47:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:21,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:21,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:21,082 INFO L87 Difference]: Start difference. First operand 10895 states and 20184 transitions. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:22,281 INFO L93 Difference]: Finished difference Result 24098 states and 44676 transitions. [2024-11-09 19:47:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:22,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 553 [2024-11-09 19:47:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:22,312 INFO L225 Difference]: With dead ends: 24098 [2024-11-09 19:47:22,312 INFO L226 Difference]: Without dead ends: 13865 [2024-11-09 19:47:22,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:22,323 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 453 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:22,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 41 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13865 states. [2024-11-09 19:47:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13865 to 13205. [2024-11-09 19:47:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13205 states, 13204 states have (on average 1.8488336867615873) internal successors, (24412), 13204 states have internal predecessors, (24412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13205 states to 13205 states and 24412 transitions. [2024-11-09 19:47:22,515 INFO L78 Accepts]: Start accepts. Automaton has 13205 states and 24412 transitions. Word has length 553 [2024-11-09 19:47:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:22,516 INFO L471 AbstractCegarLoop]: Abstraction has 13205 states and 24412 transitions. [2024-11-09 19:47:22,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13205 states and 24412 transitions. [2024-11-09 19:47:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-11-09 19:47:22,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:22,522 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:22,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:47:22,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:22,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2007346286, now seen corresponding path program 1 times [2024-11-09 19:47:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:22,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508891605] [2024-11-09 19:47:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 19:47:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:23,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508891605] [2024-11-09 19:47:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508891605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:23,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:23,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518408821] [2024-11-09 19:47:23,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:47:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:47:23,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:23,435 INFO L87 Difference]: Start difference. First operand 13205 states and 24412 transitions. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:24,877 INFO L93 Difference]: Finished difference Result 25748 states and 47628 transitions. [2024-11-09 19:47:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:24,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 607 [2024-11-09 19:47:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:24,901 INFO L225 Difference]: With dead ends: 25748 [2024-11-09 19:47:24,901 INFO L226 Difference]: Without dead ends: 13205 [2024-11-09 19:47:24,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:24,915 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 435 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:24,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 124 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:47:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13205 states. [2024-11-09 19:47:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13205 to 13205. [2024-11-09 19:47:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13205 states, 13204 states have (on average 1.8485307482581037) internal successors, (24408), 13204 states have internal predecessors, (24408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13205 states to 13205 states and 24408 transitions. [2024-11-09 19:47:25,191 INFO L78 Accepts]: Start accepts. Automaton has 13205 states and 24408 transitions. Word has length 607 [2024-11-09 19:47:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:25,191 INFO L471 AbstractCegarLoop]: Abstraction has 13205 states and 24408 transitions. [2024-11-09 19:47:25,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13205 states and 24408 transitions. [2024-11-09 19:47:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2024-11-09 19:47:25,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:25,205 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:25,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:47:25,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:25,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash -959933752, now seen corresponding path program 1 times [2024-11-09 19:47:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334281785] [2024-11-09 19:47:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2024-11-09 19:47:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334281785] [2024-11-09 19:47:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334281785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444721342] [2024-11-09 19:47:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:25,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:25,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:25,781 INFO L87 Difference]: Start difference. First operand 13205 states and 24408 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:27,105 INFO L93 Difference]: Finished difference Result 25748 states and 47624 transitions. [2024-11-09 19:47:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:27,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 668 [2024-11-09 19:47:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:27,125 INFO L225 Difference]: With dead ends: 25748 [2024-11-09 19:47:27,125 INFO L226 Difference]: Without dead ends: 13205 [2024-11-09 19:47:27,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:27,137 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 559 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:27,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 694 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:47:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13205 states. [2024-11-09 19:47:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13205 to 11885. [2024-11-09 19:47:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11885 states, 11884 states have (on average 1.84643217771794) internal successors, (21943), 11884 states have internal predecessors, (21943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11885 states to 11885 states and 21943 transitions. [2024-11-09 19:47:27,333 INFO L78 Accepts]: Start accepts. Automaton has 11885 states and 21943 transitions. Word has length 668 [2024-11-09 19:47:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:27,334 INFO L471 AbstractCegarLoop]: Abstraction has 11885 states and 21943 transitions. [2024-11-09 19:47:27,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 11885 states and 21943 transitions. [2024-11-09 19:47:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2024-11-09 19:47:27,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:27,350 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:47:27,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1179000452, now seen corresponding path program 1 times [2024-11-09 19:47:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028772015] [2024-11-09 19:47:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 936 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2024-11-09 19:47:28,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028772015] [2024-11-09 19:47:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028772015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037146840] [2024-11-09 19:47:28,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:28,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:28,104 INFO L87 Difference]: Start difference. First operand 11885 states and 21943 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:29,279 INFO L93 Difference]: Finished difference Result 26078 states and 48208 transitions. [2024-11-09 19:47:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 859 [2024-11-09 19:47:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:29,303 INFO L225 Difference]: With dead ends: 26078 [2024-11-09 19:47:29,303 INFO L226 Difference]: Without dead ends: 14855 [2024-11-09 19:47:29,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:29,314 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 454 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:29,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 710 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14855 states. [2024-11-09 19:47:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14855 to 14195. [2024-11-09 19:47:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14195 states, 14194 states have (on average 1.8437367901930393) internal successors, (26170), 14194 states have internal predecessors, (26170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14195 states to 14195 states and 26170 transitions. [2024-11-09 19:47:29,504 INFO L78 Accepts]: Start accepts. Automaton has 14195 states and 26170 transitions. Word has length 859 [2024-11-09 19:47:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:29,505 INFO L471 AbstractCegarLoop]: Abstraction has 14195 states and 26170 transitions. [2024-11-09 19:47:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 14195 states and 26170 transitions. [2024-11-09 19:47:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2024-11-09 19:47:29,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:29,521 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:29,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:47:29,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:29,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash -465992644, now seen corresponding path program 1 times [2024-11-09 19:47:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665892889] [2024-11-09 19:47:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2024-11-09 19:47:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665892889] [2024-11-09 19:47:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665892889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:30,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596038735] [2024-11-09 19:47:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:30,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:30,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:30,161 INFO L87 Difference]: Start difference. First operand 14195 states and 26170 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:31,473 INFO L93 Difference]: Finished difference Result 33668 states and 62199 transitions. [2024-11-09 19:47:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:31,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 867 [2024-11-09 19:47:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:31,500 INFO L225 Difference]: With dead ends: 33668 [2024-11-09 19:47:31,501 INFO L226 Difference]: Without dead ends: 17825 [2024-11-09 19:47:31,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:31,510 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 551 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:31,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 697 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17825 states. [2024-11-09 19:47:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17825 to 17165. [2024-11-09 19:47:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17165 states, 17164 states have (on average 1.8340130505709624) internal successors, (31479), 17164 states have internal predecessors, (31479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17165 states to 17165 states and 31479 transitions. [2024-11-09 19:47:31,809 INFO L78 Accepts]: Start accepts. Automaton has 17165 states and 31479 transitions. Word has length 867 [2024-11-09 19:47:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:31,810 INFO L471 AbstractCegarLoop]: Abstraction has 17165 states and 31479 transitions. [2024-11-09 19:47:31,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17165 states and 31479 transitions. [2024-11-09 19:47:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2024-11-09 19:47:31,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:31,842 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:47:31,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1115539140, now seen corresponding path program 1 times [2024-11-09 19:47:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821625239] [2024-11-09 19:47:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 696 proven. 804 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-09 19:47:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821625239] [2024-11-09 19:47:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821625239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:47:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443976269] [2024-11-09 19:47:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:33,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:47:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:47:33,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:47:33,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:47:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:33,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:47:33,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:47:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 1066 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-11-09 19:47:34,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:47:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443976269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:47:34,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 19:47:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287118653] [2024-11-09 19:47:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:34,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:47:34,099 INFO L87 Difference]: Start difference. First operand 17165 states and 31479 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:35,250 INFO L93 Difference]: Finished difference Result 33668 states and 61766 transitions. [2024-11-09 19:47:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1084 [2024-11-09 19:47:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:35,271 INFO L225 Difference]: With dead ends: 33668 [2024-11-09 19:47:35,271 INFO L226 Difference]: Without dead ends: 17165 [2024-11-09 19:47:35,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1088 GetRequests, 1084 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:47:35,282 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 356 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:35,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 644 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17165 states. [2024-11-09 19:47:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17165 to 17165. [2024-11-09 19:47:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17165 states, 17164 states have (on average 1.8287695175949663) internal successors, (31389), 17164 states have internal predecessors, (31389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17165 states to 17165 states and 31389 transitions. [2024-11-09 19:47:35,487 INFO L78 Accepts]: Start accepts. Automaton has 17165 states and 31389 transitions. Word has length 1084 [2024-11-09 19:47:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:35,488 INFO L471 AbstractCegarLoop]: Abstraction has 17165 states and 31389 transitions. [2024-11-09 19:47:35,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17165 states and 31389 transitions. [2024-11-09 19:47:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2024-11-09 19:47:35,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:35,502 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:35,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:47:35,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 19:47:35,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:35,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash -429059596, now seen corresponding path program 1 times [2024-11-09 19:47:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933439973] [2024-11-09 19:47:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1809 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-09 19:47:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933439973] [2024-11-09 19:47:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933439973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:36,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929122378] [2024-11-09 19:47:36,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:36,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:36,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:36,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:36,280 INFO L87 Difference]: Start difference. First operand 17165 states and 31389 transitions. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:37,450 INFO L93 Difference]: Finished difference Result 33668 states and 61586 transitions. [2024-11-09 19:47:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1143 [2024-11-09 19:47:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:37,475 INFO L225 Difference]: With dead ends: 33668 [2024-11-09 19:47:37,475 INFO L226 Difference]: Without dead ends: 17165 [2024-11-09 19:47:37,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:37,488 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 482 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:37,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 695 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17165 states. [2024-11-09 19:47:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17165 to 15845. [2024-11-09 19:47:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15845 states, 15844 states have (on average 1.8239081040141378) internal successors, (28898), 15844 states have internal predecessors, (28898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15845 states to 15845 states and 28898 transitions. [2024-11-09 19:47:37,655 INFO L78 Accepts]: Start accepts. Automaton has 15845 states and 28898 transitions. Word has length 1143 [2024-11-09 19:47:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:37,656 INFO L471 AbstractCegarLoop]: Abstraction has 15845 states and 28898 transitions. [2024-11-09 19:47:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15845 states and 28898 transitions. [2024-11-09 19:47:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2024-11-09 19:47:37,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:37,671 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:37,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:47:37,671 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1456627724, now seen corresponding path program 1 times [2024-11-09 19:47:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599035920] [2024-11-09 19:47:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2581 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2024-11-09 19:47:38,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:38,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599035920] [2024-11-09 19:47:38,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599035920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:38,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:38,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464637945] [2024-11-09 19:47:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:38,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:38,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:38,387 INFO L87 Difference]: Start difference. First operand 15845 states and 28898 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:39,635 INFO L93 Difference]: Finished difference Result 33998 states and 62065 transitions. [2024-11-09 19:47:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1144 [2024-11-09 19:47:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:39,657 INFO L225 Difference]: With dead ends: 33998 [2024-11-09 19:47:39,657 INFO L226 Difference]: Without dead ends: 16505 [2024-11-09 19:47:39,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:39,670 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 537 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:39,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 677 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16505 states. [2024-11-09 19:47:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16505 to 13865. [2024-11-09 19:47:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13865 states, 13864 states have (on average 1.819676860934795) internal successors, (25228), 13864 states have internal predecessors, (25228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 25228 transitions. [2024-11-09 19:47:39,832 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 25228 transitions. Word has length 1144 [2024-11-09 19:47:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:39,832 INFO L471 AbstractCegarLoop]: Abstraction has 13865 states and 25228 transitions. [2024-11-09 19:47:39,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 25228 transitions. [2024-11-09 19:47:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2024-11-09 19:47:39,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:39,848 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:39,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:47:39,848 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:39,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash 456210810, now seen corresponding path program 1 times [2024-11-09 19:47:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:39,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431300250] [2024-11-09 19:47:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2901 backedges. 2068 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-09 19:47:41,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:41,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431300250] [2024-11-09 19:47:41,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431300250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:41,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:41,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:47:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156117708] [2024-11-09 19:47:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 19:47:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 19:47:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:47:41,112 INFO L87 Difference]: Start difference. First operand 13865 states and 25228 transitions. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:42,699 INFO L93 Difference]: Finished difference Result 27069 states and 49265 transitions. [2024-11-09 19:47:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 19:47:42,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1272 [2024-11-09 19:47:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:42,720 INFO L225 Difference]: With dead ends: 27069 [2024-11-09 19:47:42,720 INFO L226 Difference]: Without dead ends: 13866 [2024-11-09 19:47:42,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:47:42,730 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 546 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:42,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 704 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:47:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13866 states. [2024-11-09 19:47:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13866 to 13865. [2024-11-09 19:47:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13865 states, 13864 states have (on average 1.8193883439122909) internal successors, (25224), 13864 states have internal predecessors, (25224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 25224 transitions. [2024-11-09 19:47:42,857 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 25224 transitions. Word has length 1272 [2024-11-09 19:47:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:42,857 INFO L471 AbstractCegarLoop]: Abstraction has 13865 states and 25224 transitions. [2024-11-09 19:47:42,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 25224 transitions. [2024-11-09 19:47:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1286 [2024-11-09 19:47:42,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:42,912 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:42,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:47:42,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:42,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash -698316102, now seen corresponding path program 1 times [2024-11-09 19:47:42,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:42,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168490872] [2024-11-09 19:47:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2024-11-09 19:47:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168490872] [2024-11-09 19:47:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168490872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:47:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805824822] [2024-11-09 19:47:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:44,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:47:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:44,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:47:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:44,450 INFO L87 Difference]: Start difference. First operand 13865 states and 25224 transitions. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:46,068 INFO L93 Difference]: Finished difference Result 27078 states and 49266 transitions. [2024-11-09 19:47:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 19:47:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1285 [2024-11-09 19:47:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:46,083 INFO L225 Difference]: With dead ends: 27078 [2024-11-09 19:47:46,083 INFO L226 Difference]: Without dead ends: 13875 [2024-11-09 19:47:46,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-09 19:47:46,090 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 479 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:46,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 706 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:47:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13875 states. [2024-11-09 19:47:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13875 to 13865. [2024-11-09 19:47:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13865 states, 13864 states have (on average 1.8190998268897864) internal successors, (25220), 13864 states have internal predecessors, (25220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 25220 transitions. [2024-11-09 19:47:46,203 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 25220 transitions. Word has length 1285 [2024-11-09 19:47:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:46,203 INFO L471 AbstractCegarLoop]: Abstraction has 13865 states and 25220 transitions. [2024-11-09 19:47:46,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 25220 transitions. [2024-11-09 19:47:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1303 [2024-11-09 19:47:46,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:46,217 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:46,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:47:46,217 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:46,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -505827212, now seen corresponding path program 1 times [2024-11-09 19:47:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059135250] [2024-11-09 19:47:46,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 2127 proven. 0 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2024-11-09 19:47:47,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059135250] [2024-11-09 19:47:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059135250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:47,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:47,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330196253] [2024-11-09 19:47:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:47,369 INFO L87 Difference]: Start difference. First operand 13865 states and 25220 transitions. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:48,534 INFO L93 Difference]: Finished difference Result 27728 states and 50440 transitions. [2024-11-09 19:47:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1302 [2024-11-09 19:47:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:48,551 INFO L225 Difference]: With dead ends: 27728 [2024-11-09 19:47:48,551 INFO L226 Difference]: Without dead ends: 14525 [2024-11-09 19:47:48,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:48,560 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 486 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:48,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 697 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:47:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2024-11-09 19:47:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 14525. [2024-11-09 19:47:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14525 states, 14524 states have (on average 1.81823189204076) internal successors, (26408), 14524 states have internal predecessors, (26408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14525 states to 14525 states and 26408 transitions. [2024-11-09 19:47:48,711 INFO L78 Accepts]: Start accepts. Automaton has 14525 states and 26408 transitions. Word has length 1302 [2024-11-09 19:47:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 14525 states and 26408 transitions. [2024-11-09 19:47:48,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14525 states and 26408 transitions. [2024-11-09 19:47:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1327 [2024-11-09 19:47:48,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:48,739 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:48,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:47:48,740 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:48,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1237846224, now seen corresponding path program 1 times [2024-11-09 19:47:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269285128] [2024-11-09 19:47:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3144 backedges. 2178 proven. 0 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-11-09 19:47:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269285128] [2024-11-09 19:47:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269285128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:49,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:47:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742246950] [2024-11-09 19:47:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:49,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:47:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:47:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:47:49,910 INFO L87 Difference]: Start difference. First operand 14525 states and 26408 transitions. Second operand has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:51,405 INFO L93 Difference]: Finished difference Result 28388 states and 51624 transitions. [2024-11-09 19:47:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:47:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1326 [2024-11-09 19:47:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:51,421 INFO L225 Difference]: With dead ends: 28388 [2024-11-09 19:47:51,421 INFO L226 Difference]: Without dead ends: 14525 [2024-11-09 19:47:51,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-09 19:47:51,430 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 382 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:51,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 866 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:47:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2024-11-09 19:47:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 14525. [2024-11-09 19:47:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14525 states, 14524 states have (on average 1.8175433764803084) internal successors, (26398), 14524 states have internal predecessors, (26398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14525 states to 14525 states and 26398 transitions. [2024-11-09 19:47:51,554 INFO L78 Accepts]: Start accepts. Automaton has 14525 states and 26398 transitions. Word has length 1326 [2024-11-09 19:47:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:51,554 INFO L471 AbstractCegarLoop]: Abstraction has 14525 states and 26398 transitions. [2024-11-09 19:47:51,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 14525 states and 26398 transitions. [2024-11-09 19:47:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1357 [2024-11-09 19:47:51,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:51,569 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:51,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:47:51,569 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:51,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 260328154, now seen corresponding path program 1 times [2024-11-09 19:47:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834053520] [2024-11-09 19:47:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 2749 trivial. 0 not checked. [2024-11-09 19:47:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834053520] [2024-11-09 19:47:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834053520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:52,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:52,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991154316] [2024-11-09 19:47:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:52,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:52,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:52,216 INFO L87 Difference]: Start difference. First operand 14525 states and 26398 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:53,311 INFO L93 Difference]: Finished difference Result 28718 states and 52200 transitions. [2024-11-09 19:47:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1356 [2024-11-09 19:47:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:53,329 INFO L225 Difference]: With dead ends: 28718 [2024-11-09 19:47:53,329 INFO L226 Difference]: Without dead ends: 14525 [2024-11-09 19:47:53,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:53,338 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 531 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:53,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 674 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:47:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2024-11-09 19:47:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 13865. [2024-11-09 19:47:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13865 states, 13864 states have (on average 1.8120311598384304) internal successors, (25122), 13864 states have internal predecessors, (25122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 25122 transitions. [2024-11-09 19:47:53,469 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 25122 transitions. Word has length 1356 [2024-11-09 19:47:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:53,470 INFO L471 AbstractCegarLoop]: Abstraction has 13865 states and 25122 transitions. [2024-11-09 19:47:53,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 25122 transitions. [2024-11-09 19:47:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1455 [2024-11-09 19:47:53,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:47:53,493 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:47:53,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 19:47:53,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:47:53,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:47:53,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1708049484, now seen corresponding path program 1 times [2024-11-09 19:47:53,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:47:53,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550022504] [2024-11-09 19:47:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:47:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:47:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:47:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4093 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 2798 trivial. 0 not checked. [2024-11-09 19:47:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:47:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550022504] [2024-11-09 19:47:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550022504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:47:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:47:54,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:47:54,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344340152] [2024-11-09 19:47:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:47:54,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:47:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:47:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:47:54,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:54,254 INFO L87 Difference]: Start difference. First operand 13865 states and 25122 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:47:55,357 INFO L93 Difference]: Finished difference Result 27065 states and 49052 transitions. [2024-11-09 19:47:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:47:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1454 [2024-11-09 19:47:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:47:55,359 INFO L225 Difference]: With dead ends: 27065 [2024-11-09 19:47:55,359 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:47:55,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:47:55,370 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 430 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:47:55,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 678 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:47:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:47:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:47:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:47:55,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1454 [2024-11-09 19:47:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:47:55,372 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:47:55,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:47:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:47:55,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:47:55,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:47:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 19:47:55,379 INFO L407 BasicCegarLoop]: Path program histogram: [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-09 19:47:55,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:47:56,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:47:56,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:47:56 BoogieIcfgContainer [2024-11-09 19:47:56,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:47:56,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:47:56,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:47:56,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:47:56,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:46:59" (3/4) ... [2024-11-09 19:47:56,605 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:47:56,640 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 19:47:56,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:47:56,648 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:47:56,652 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:47:56,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:47:56,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:47:56,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:47:56,908 INFO L158 Benchmark]: Toolchain (without parser) took 62080.14ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 101.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 781.1MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,908 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:47:56,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 963.17ms. Allocated memory is still 161.5MB. Free memory was 101.2MB in the beginning and 118.8MB in the end (delta: -17.6MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.79ms. Allocated memory is still 161.5MB. Free memory was 118.8MB in the beginning and 95.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,909 INFO L158 Benchmark]: Boogie Preprocessor took 212.33ms. Allocated memory is still 161.5MB. Free memory was 95.0MB in the beginning and 61.2MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,910 INFO L158 Benchmark]: IcfgBuilder took 2930.78ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 61.2MB in the beginning and 139.0MB in the end (delta: -77.8MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,911 INFO L158 Benchmark]: TraceAbstraction took 57512.66ms. Allocated memory was 249.6MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 138.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 687.6MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,911 INFO L158 Benchmark]: Witness Printer took 305.24ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 19:47:56,913 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 963.17ms. Allocated memory is still 161.5MB. Free memory was 101.2MB in the beginning and 118.8MB in the end (delta: -17.6MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.79ms. Allocated memory is still 161.5MB. Free memory was 118.8MB in the beginning and 95.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 212.33ms. Allocated memory is still 161.5MB. Free memory was 95.0MB in the beginning and 61.2MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2930.78ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 61.2MB in the beginning and 139.0MB in the end (delta: -77.8MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. * TraceAbstraction took 57512.66ms. Allocated memory was 249.6MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 138.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 687.6MB. Max. memory is 16.1GB. * Witness Printer took 305.24ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 167]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 399 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.2s, OverallIterations: 23, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11659 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11659 mSDsluCounter, 10648 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 440 mSDsCounter, 2782 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37279 IncrementalHoareTripleChecker+Invalid, 40061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2782 mSolverCounterUnsat, 10208 mSDtfsCounter, 37279 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1168 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17165occurred in iteration=14, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 8264 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 18634 NumberOfCodeBlocks, 18634 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 18610 ConstructedInterpolants, 0 QuantifiedInterpolants, 44032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1247 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 33783/34587 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:47:56,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE