./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:13:34,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:13:34,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:13:34,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:13:34,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:13:34,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:13:34,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:13:34,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:13:34,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:13:34,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:13:34,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:13:34,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:13:34,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:13:34,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:13:34,831 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:13:34,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:13:34,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:13:34,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:13:34,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:13:34,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:13:34,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:13:34,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:13:34,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:13:34,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:13:34,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:13:34,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:13:34,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:13:34,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:13:34,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:13:34,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:13:34,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:13:34,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:13:34,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:13:34,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:13:34,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:13:34,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:13:34,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:13:34,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:13:34,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:13:34,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:13:34,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:13:34,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:13:34,842 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2024-10-23 20:13:35,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:13:35,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:13:35,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:13:35,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:13:35,121 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:13:35,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-23 20:13:36,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:13:36,754 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:13:36,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-23 20:13:36,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dabd8b92a/4aae77ee272c4b76a5d488ac7d931844/FLAG9441ee06a [2024-10-23 20:13:37,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dabd8b92a/4aae77ee272c4b76a5d488ac7d931844 [2024-10-23 20:13:37,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:13:37,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:13:37,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:13:37,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:13:37,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:13:37,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed6cdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37, skipping insertion in model container [2024-10-23 20:13:37,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:13:37,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-10-23 20:13:37,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:13:37,461 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:13:37,504 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-10-23 20:13:37,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:13:37,525 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:13:37,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37 WrapperNode [2024-10-23 20:13:37,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:13:37,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:13:37,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:13:37,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:13:37,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,586 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 644 [2024-10-23 20:13:37,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:13:37,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:13:37,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:13:37,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:13:37,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 20:13:37,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:13:37,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:13:37,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:13:37,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:13:37,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (1/1) ... [2024-10-23 20:13:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:13:37,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:13:37,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 20:13:37,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 20:13:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:13:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:13:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:13:37,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:13:37,891 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:13:37,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:13:37,908 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-23 20:13:38,467 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-10-23 20:13:38,467 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-10-23 20:13:38,516 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-23 20:13:38,516 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:13:38,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:13:38,573 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:13:38,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:13:38 BoogieIcfgContainer [2024-10-23 20:13:38,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:13:38,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:13:38,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:13:38,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:13:38,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:13:37" (1/3) ... [2024-10-23 20:13:38,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5265d923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:13:38, skipping insertion in model container [2024-10-23 20:13:38,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:13:37" (2/3) ... [2024-10-23 20:13:38,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5265d923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:13:38, skipping insertion in model container [2024-10-23 20:13:38,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:13:38" (3/3) ... [2024-10-23 20:13:38,583 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-10-23 20:13:38,599 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:13:38,600 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:13:38,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:13:38,667 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;@7a0ae875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:13:38,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:13:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 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-10-23 20:13:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-23 20:13:38,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:38,681 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] [2024-10-23 20:13:38,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1162804964, now seen corresponding path program 1 times [2024-10-23 20:13:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:38,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741585902] [2024-10-23 20:13:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:13:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741585902] [2024-10-23 20:13:38,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741585902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:38,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:13:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049547683] [2024-10-23 20:13:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:38,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:39,005 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 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 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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-10-23 20:13:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:39,251 INFO L93 Difference]: Finished difference Result 328 states and 575 transitions. [2024-10-23 20:13:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2024-10-23 20:13:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:39,267 INFO L225 Difference]: With dead ends: 328 [2024-10-23 20:13:39,267 INFO L226 Difference]: Without dead ends: 168 [2024-10-23 20:13:39,271 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-10-23 20:13:39,278 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:39,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 431 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 20:13:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-23 20:13:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-23 20:13:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5688622754491017) internal successors, (262), 167 states have internal predecessors, (262), 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-10-23 20:13:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 262 transitions. [2024-10-23 20:13:39,371 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 262 transitions. Word has length 43 [2024-10-23 20:13:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:39,372 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 262 transitions. [2024-10-23 20:13:39,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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-10-23 20:13:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 262 transitions. [2024-10-23 20:13:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-23 20:13:39,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:39,379 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 20:13:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:13:39,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -51465524, now seen corresponding path program 1 times [2024-10-23 20:13:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:39,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481783036] [2024-10-23 20:13:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:13:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481783036] [2024-10-23 20:13:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481783036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:39,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619632297] [2024-10-23 20:13:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:39,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:39,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:39,545 INFO L87 Difference]: Start difference. First operand 168 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-10-23 20:13:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:39,726 INFO L93 Difference]: Finished difference Result 343 states and 540 transitions. [2024-10-23 20:13:39,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:39,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2024-10-23 20:13:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:39,729 INFO L225 Difference]: With dead ends: 343 [2024-10-23 20:13:39,732 INFO L226 Difference]: Without dead ends: 188 [2024-10-23 20:13:39,733 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-10-23 20:13:39,734 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:39,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 375 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 20:13:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-23 20:13:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-23 20:13:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.53475935828877) internal successors, (287), 187 states have internal predecessors, (287), 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-10-23 20:13:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-10-23 20:13:39,749 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 58 [2024-10-23 20:13:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:39,750 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-10-23 20:13:39,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-10-23 20:13:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-10-23 20:13:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-23 20:13:39,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:39,753 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 20:13:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:13:39,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:39,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:39,755 INFO L85 PathProgramCache]: Analyzing trace with hash -900899268, now seen corresponding path program 1 times [2024-10-23 20:13:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995966320] [2024-10-23 20:13:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 20:13:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995966320] [2024-10-23 20:13:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995966320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244825999] [2024-10-23 20:13:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:39,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:39,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:39,887 INFO L87 Difference]: Start difference. First operand 188 states and 287 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-23 20:13:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:40,083 INFO L93 Difference]: Finished difference Result 404 states and 630 transitions. [2024-10-23 20:13:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 78 [2024-10-23 20:13:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:40,086 INFO L225 Difference]: With dead ends: 404 [2024-10-23 20:13:40,089 INFO L226 Difference]: Without dead ends: 229 [2024-10-23 20:13:40,090 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-10-23 20:13:40,093 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:40,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 372 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 20:13:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-23 20:13:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-23 20:13:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4605263157894737) internal successors, (333), 228 states have internal predecessors, (333), 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-10-23 20:13:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 333 transitions. [2024-10-23 20:13:40,117 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 333 transitions. Word has length 78 [2024-10-23 20:13:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:40,118 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 333 transitions. [2024-10-23 20:13:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-23 20:13:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 333 transitions. [2024-10-23 20:13:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-23 20:13:40,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:40,125 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 20:13:40,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:13:40,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash -477252546, now seen corresponding path program 1 times [2024-10-23 20:13:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734080892] [2024-10-23 20:13:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 20:13:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734080892] [2024-10-23 20:13:40,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734080892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:40,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:40,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850433256] [2024-10-23 20:13:40,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:40,242 INFO L87 Difference]: Start difference. First operand 229 states and 333 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-23 20:13:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:40,373 INFO L93 Difference]: Finished difference Result 467 states and 686 transitions. [2024-10-23 20:13:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 78 [2024-10-23 20:13:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:40,375 INFO L225 Difference]: With dead ends: 467 [2024-10-23 20:13:40,376 INFO L226 Difference]: Without dead ends: 251 [2024-10-23 20:13:40,376 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-10-23 20:13:40,377 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:40,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-23 20:13:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-23 20:13:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.44) internal successors, (360), 250 states have internal predecessors, (360), 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-10-23 20:13:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 360 transitions. [2024-10-23 20:13:40,388 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 360 transitions. Word has length 78 [2024-10-23 20:13:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:40,389 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 360 transitions. [2024-10-23 20:13:40,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10-23 20:13:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 360 transitions. [2024-10-23 20:13:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-23 20:13:40,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:40,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:13:40,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:13:40,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:40,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1974049696, now seen corresponding path program 1 times [2024-10-23 20:13:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021272404] [2024-10-23 20:13:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-23 20:13:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021272404] [2024-10-23 20:13:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021272404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931886530] [2024-10-23 20:13:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:40,507 INFO L87 Difference]: Start difference. First operand 251 states and 360 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-10-23 20:13:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:40,636 INFO L93 Difference]: Finished difference Result 513 states and 744 transitions. [2024-10-23 20:13:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 98 [2024-10-23 20:13:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:40,639 INFO L225 Difference]: With dead ends: 513 [2024-10-23 20:13:40,639 INFO L226 Difference]: Without dead ends: 275 [2024-10-23 20:13:40,640 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-10-23 20:13:40,641 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:40,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 390 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-23 20:13:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-23 20:13:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 274 states have internal predecessors, (389), 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-10-23 20:13:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 389 transitions. [2024-10-23 20:13:40,651 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 389 transitions. Word has length 98 [2024-10-23 20:13:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:40,651 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 389 transitions. [2024-10-23 20:13:40,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-10-23 20:13:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 389 transitions. [2024-10-23 20:13:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-23 20:13:40,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:40,654 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-23 20:13:40,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:13:40,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash 340894480, now seen corresponding path program 1 times [2024-10-23 20:13:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81367772] [2024-10-23 20:13:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-23 20:13:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81367772] [2024-10-23 20:13:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81367772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181224482] [2024-10-23 20:13:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:40,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:40,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:40,803 INFO L87 Difference]: Start difference. First operand 275 states and 389 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-23 20:13:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:40,848 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2024-10-23 20:13:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 117 [2024-10-23 20:13:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:40,854 INFO L225 Difference]: With dead ends: 793 [2024-10-23 20:13:40,854 INFO L226 Difference]: Without dead ends: 531 [2024-10-23 20:13:40,855 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-10-23 20:13:40,856 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 168 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:40,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 560 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:13:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-23 20:13:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-10-23 20:13:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4056603773584906) internal successors, (745), 530 states have internal predecessors, (745), 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-10-23 20:13:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 745 transitions. [2024-10-23 20:13:40,872 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 745 transitions. Word has length 117 [2024-10-23 20:13:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 745 transitions. [2024-10-23 20:13:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-23 20:13:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 745 transitions. [2024-10-23 20:13:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-23 20:13:40,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:40,875 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-23 20:13:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:13:40,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 589040974, now seen corresponding path program 1 times [2024-10-23 20:13:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78250677] [2024-10-23 20:13:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 20:13:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78250677] [2024-10-23 20:13:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78250677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:40,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977894753] [2024-10-23 20:13:40,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:40,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:40,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:40,957 INFO L87 Difference]: Start difference. First operand 531 states and 745 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-10-23 20:13:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:41,009 INFO L93 Difference]: Finished difference Result 1307 states and 1834 transitions. [2024-10-23 20:13:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:41,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 117 [2024-10-23 20:13:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:41,014 INFO L225 Difference]: With dead ends: 1307 [2024-10-23 20:13:41,014 INFO L226 Difference]: Without dead ends: 789 [2024-10-23 20:13:41,014 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-10-23 20:13:41,015 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 170 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:41,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 580 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:13:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-23 20:13:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2024-10-23 20:13:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.401015228426396) internal successors, (1104), 788 states have internal predecessors, (1104), 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-10-23 20:13:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1104 transitions. [2024-10-23 20:13:41,042 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1104 transitions. Word has length 117 [2024-10-23 20:13:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:41,043 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1104 transitions. [2024-10-23 20:13:41,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-10-23 20:13:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1104 transitions. [2024-10-23 20:13:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-23 20:13:41,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:41,046 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-23 20:13:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:13:41,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2139168372, now seen corresponding path program 1 times [2024-10-23 20:13:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179686819] [2024-10-23 20:13:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-23 20:13:41,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:41,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179686819] [2024-10-23 20:13:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179686819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524470710] [2024-10-23 20:13:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:41,111 INFO L87 Difference]: Start difference. First operand 789 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-10-23 20:13:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:41,146 INFO L93 Difference]: Finished difference Result 1588 states and 2216 transitions. [2024-10-23 20:13:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 117 [2024-10-23 20:13:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:41,149 INFO L225 Difference]: With dead ends: 1588 [2024-10-23 20:13:41,150 INFO L226 Difference]: Without dead ends: 812 [2024-10-23 20:13:41,151 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-10-23 20:13:41,153 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 10 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:41,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:13:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-23 20:13:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2024-10-23 20:13:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 811 states have internal predecessors, (1132), 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-10-23 20:13:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1132 transitions. [2024-10-23 20:13:41,174 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1132 transitions. Word has length 117 [2024-10-23 20:13:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:41,174 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1132 transitions. [2024-10-23 20:13:41,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-10-23 20:13:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1132 transitions. [2024-10-23 20:13:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-23 20:13:41,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:41,177 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-23 20:13:41,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:13:41,178 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:41,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -241671606, now seen corresponding path program 1 times [2024-10-23 20:13:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604183367] [2024-10-23 20:13:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-23 20:13:41,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604183367] [2024-10-23 20:13:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604183367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:13:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057496175] [2024-10-23 20:13:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:41,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:41,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:41,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:41,235 INFO L87 Difference]: Start difference. First operand 812 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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-10-23 20:13:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:41,272 INFO L93 Difference]: Finished difference Result 1623 states and 2256 transitions. [2024-10-23 20:13:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:41,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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 117 [2024-10-23 20:13:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:41,276 INFO L225 Difference]: With dead ends: 1623 [2024-10-23 20:13:41,277 INFO L226 Difference]: Without dead ends: 824 [2024-10-23 20:13:41,278 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-10-23 20:13:41,279 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 15 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:41,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 437 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:13:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-23 20:13:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-10-23 20:13:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.3900364520048603) internal successors, (1144), 823 states have internal predecessors, (1144), 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-10-23 20:13:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1144 transitions. [2024-10-23 20:13:41,296 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1144 transitions. Word has length 117 [2024-10-23 20:13:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:41,296 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1144 transitions. [2024-10-23 20:13:41,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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-10-23 20:13:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1144 transitions. [2024-10-23 20:13:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-23 20:13:41,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:41,314 INFO L215 NwaCegarLoop]: trace histogram [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, 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-10-23 20:13:41,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:13:41,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash 692580231, now seen corresponding path program 1 times [2024-10-23 20:13:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418532932] [2024-10-23 20:13:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-23 20:13:41,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:41,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418532932] [2024-10-23 20:13:41,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418532932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:41,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:41,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95077575] [2024-10-23 20:13:41,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:41,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:41,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:41,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:41,400 INFO L87 Difference]: Start difference. First operand 824 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-10-23 20:13:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:41,568 INFO L93 Difference]: Finished difference Result 1731 states and 2448 transitions. [2024-10-23 20:13:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 154 [2024-10-23 20:13:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:41,573 INFO L225 Difference]: With dead ends: 1731 [2024-10-23 20:13:41,573 INFO L226 Difference]: Without dead ends: 932 [2024-10-23 20:13:41,574 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-10-23 20:13:41,575 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 26 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:41,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 381 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-23 20:13:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 904. [2024-10-23 20:13:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.3732004429678848) internal successors, (1240), 903 states have internal predecessors, (1240), 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-10-23 20:13:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1240 transitions. [2024-10-23 20:13:41,596 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1240 transitions. Word has length 154 [2024-10-23 20:13:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1240 transitions. [2024-10-23 20:13:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-10-23 20:13:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1240 transitions. [2024-10-23 20:13:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-23 20:13:41,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:41,600 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-10-23 20:13:41,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 20:13:41,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:41,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1951696596, now seen corresponding path program 1 times [2024-10-23 20:13:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:41,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098409085] [2024-10-23 20:13:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-23 20:13:41,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098409085] [2024-10-23 20:13:41,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098409085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:41,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:41,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:41,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717233186] [2024-10-23 20:13:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:41,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:41,683 INFO L87 Difference]: Start difference. First operand 904 states and 1240 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-10-23 20:13:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:41,836 INFO L93 Difference]: Finished difference Result 1933 states and 2720 transitions. [2024-10-23 20:13:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:41,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 165 [2024-10-23 20:13:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:41,840 INFO L225 Difference]: With dead ends: 1933 [2024-10-23 20:13:41,840 INFO L226 Difference]: Without dead ends: 1051 [2024-10-23 20:13:41,841 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-10-23 20:13:41,842 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:41,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 291 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-23 20:13:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-23 20:13:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.418095238095238) internal successors, (1489), 1050 states have internal predecessors, (1489), 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-10-23 20:13:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1489 transitions. [2024-10-23 20:13:41,863 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1489 transitions. Word has length 165 [2024-10-23 20:13:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:41,863 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1489 transitions. [2024-10-23 20:13:41,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-10-23 20:13:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1489 transitions. [2024-10-23 20:13:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-23 20:13:41,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:41,867 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 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] [2024-10-23 20:13:41,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 20:13:41,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:41,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash 442861685, now seen corresponding path program 1 times [2024-10-23 20:13:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257607999] [2024-10-23 20:13:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-23 20:13:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257607999] [2024-10-23 20:13:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257607999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:41,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901683146] [2024-10-23 20:13:41,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:41,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:41,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:41,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:41,963 INFO L87 Difference]: Start difference. First operand 1051 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-10-23 20:13:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:42,109 INFO L93 Difference]: Finished difference Result 2167 states and 3107 transitions. [2024-10-23 20:13:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:42,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 196 [2024-10-23 20:13:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:42,114 INFO L225 Difference]: With dead ends: 2167 [2024-10-23 20:13:42,115 INFO L226 Difference]: Without dead ends: 1141 [2024-10-23 20:13:42,117 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-10-23 20:13:42,117 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:42,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 388 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-10-23 20:13:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2024-10-23 20:13:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3982456140350876) internal successors, (1594), 1140 states have internal predecessors, (1594), 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-10-23 20:13:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1594 transitions. [2024-10-23 20:13:42,141 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1594 transitions. Word has length 196 [2024-10-23 20:13:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:42,142 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1594 transitions. [2024-10-23 20:13:42,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-10-23 20:13:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1594 transitions. [2024-10-23 20:13:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-23 20:13:42,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:42,146 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-10-23 20:13:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 20:13:42,146 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:42,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1409517476, now seen corresponding path program 1 times [2024-10-23 20:13:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:42,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291707381] [2024-10-23 20:13:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-23 20:13:42,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:42,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291707381] [2024-10-23 20:13:42,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291707381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:42,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:42,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398535570] [2024-10-23 20:13:42,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:42,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:42,250 INFO L87 Difference]: Start difference. First operand 1141 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-10-23 20:13:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:42,412 INFO L93 Difference]: Finished difference Result 2380 states and 3380 transitions. [2024-10-23 20:13:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:42,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 223 [2024-10-23 20:13:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:42,417 INFO L225 Difference]: With dead ends: 2380 [2024-10-23 20:13:42,418 INFO L226 Difference]: Without dead ends: 1139 [2024-10-23 20:13:42,419 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-10-23 20:13:42,420 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:42,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-23 20:13:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-23 20:13:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.3919156414762741) internal successors, (1584), 1138 states have internal predecessors, (1584), 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-10-23 20:13:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1584 transitions. [2024-10-23 20:13:42,443 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1584 transitions. Word has length 223 [2024-10-23 20:13:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:42,444 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1584 transitions. [2024-10-23 20:13:42,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-10-23 20:13:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1584 transitions. [2024-10-23 20:13:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-23 20:13:42,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:42,448 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-23 20:13:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 20:13:42,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1957206764, now seen corresponding path program 1 times [2024-10-23 20:13:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510495770] [2024-10-23 20:13:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-23 20:13:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510495770] [2024-10-23 20:13:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510495770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739329734] [2024-10-23 20:13:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:42,569 INFO L87 Difference]: Start difference. First operand 1139 states and 1584 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-23 20:13:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:42,619 INFO L93 Difference]: Finished difference Result 3254 states and 4553 transitions. [2024-10-23 20:13:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:42,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 262 [2024-10-23 20:13:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:42,626 INFO L225 Difference]: With dead ends: 3254 [2024-10-23 20:13:42,626 INFO L226 Difference]: Without dead ends: 1449 [2024-10-23 20:13:42,629 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-10-23 20:13:42,630 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 156 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:42,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 634 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:13:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-10-23 20:13:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2024-10-23 20:13:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1446 states have (on average 1.3955739972337482) internal successors, (2018), 1446 states have internal predecessors, (2018), 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-10-23 20:13:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2018 transitions. [2024-10-23 20:13:42,668 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2018 transitions. Word has length 262 [2024-10-23 20:13:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:42,669 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2018 transitions. [2024-10-23 20:13:42,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-23 20:13:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2018 transitions. [2024-10-23 20:13:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-23 20:13:42,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:42,675 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-23 20:13:42,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 20:13:42,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:42,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1169172624, now seen corresponding path program 1 times [2024-10-23 20:13:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597676482] [2024-10-23 20:13:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-10-23 20:13:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597676482] [2024-10-23 20:13:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597676482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955342068] [2024-10-23 20:13:42,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:42,769 INFO L87 Difference]: Start difference. First operand 1447 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-10-23 20:13:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:42,906 INFO L93 Difference]: Finished difference Result 2973 states and 4183 transitions. [2024-10-23 20:13:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 308 [2024-10-23 20:13:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:42,913 INFO L225 Difference]: With dead ends: 2973 [2024-10-23 20:13:42,913 INFO L226 Difference]: Without dead ends: 1551 [2024-10-23 20:13:42,915 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-10-23 20:13:42,916 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:42,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-10-23 20:13:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2024-10-23 20:13:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.3819354838709677) internal successors, (2142), 1550 states have internal predecessors, (2142), 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-10-23 20:13:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2142 transitions. [2024-10-23 20:13:42,949 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2142 transitions. Word has length 308 [2024-10-23 20:13:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:42,950 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2142 transitions. [2024-10-23 20:13:42,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-10-23 20:13:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2142 transitions. [2024-10-23 20:13:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-23 20:13:42,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:42,955 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-23 20:13:42,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 20:13:42,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:42,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 949109441, now seen corresponding path program 1 times [2024-10-23 20:13:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:42,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491489471] [2024-10-23 20:13:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-10-23 20:13:43,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491489471] [2024-10-23 20:13:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491489471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218679280] [2024-10-23 20:13:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:43,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:43,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:43,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:43,055 INFO L87 Difference]: Start difference. First operand 1551 states and 2142 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-10-23 20:13:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:43,222 INFO L93 Difference]: Finished difference Result 3189 states and 4447 transitions. [2024-10-23 20:13:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 330 [2024-10-23 20:13:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:43,228 INFO L225 Difference]: With dead ends: 3189 [2024-10-23 20:13:43,229 INFO L226 Difference]: Without dead ends: 1663 [2024-10-23 20:13:43,231 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-10-23 20:13:43,232 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:43,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-23 20:13:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-10-23 20:13:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.3682310469314078) internal successors, (2274), 1662 states have internal predecessors, (2274), 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-10-23 20:13:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2274 transitions. [2024-10-23 20:13:43,266 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2274 transitions. Word has length 330 [2024-10-23 20:13:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:43,266 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2274 transitions. [2024-10-23 20:13:43,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-10-23 20:13:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2274 transitions. [2024-10-23 20:13:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-23 20:13:43,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:43,272 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-23 20:13:43,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 20:13:43,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:43,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1022881964, now seen corresponding path program 1 times [2024-10-23 20:13:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:43,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121809854] [2024-10-23 20:13:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-23 20:13:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121809854] [2024-10-23 20:13:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121809854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:13:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057514224] [2024-10-23 20:13:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:43,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:13:43,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:13:43,417 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-10-23 20:13:43,418 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-10-23 20:13:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:43,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 20:13:43,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:13:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-23 20:13:43,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 20:13:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-23 20:13:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057514224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 20:13:43,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 20:13:43,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-23 20:13:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829663403] [2024-10-23 20:13:43,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 20:13:43,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 20:13:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:43,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 20:13:43,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:13:43,836 INFO L87 Difference]: Start difference. First operand 1663 states and 2274 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 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-10-23 20:13:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:44,314 INFO L93 Difference]: Finished difference Result 4040 states and 5599 transitions. [2024-10-23 20:13:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 20:13:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 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 362 [2024-10-23 20:13:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:44,323 INFO L225 Difference]: With dead ends: 4040 [2024-10-23 20:13:44,323 INFO L226 Difference]: Without dead ends: 2283 [2024-10-23 20:13:44,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-23 20:13:44,328 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 523 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:44,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1006 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:13:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2024-10-23 20:13:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1675. [2024-10-23 20:13:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.3536439665471924) internal successors, (2266), 1674 states have internal predecessors, (2266), 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-10-23 20:13:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2266 transitions. [2024-10-23 20:13:44,369 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2266 transitions. Word has length 362 [2024-10-23 20:13:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:44,369 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2266 transitions. [2024-10-23 20:13:44,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 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-10-23 20:13:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2266 transitions. [2024-10-23 20:13:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-10-23 20:13:44,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:44,377 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2024-10-23 20:13:44,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-23 20:13:44,577 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,SelfDestructingSolverStorable16 [2024-10-23 20:13:44,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:44,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1312534653, now seen corresponding path program 1 times [2024-10-23 20:13:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987269572] [2024-10-23 20:13:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1260 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-23 20:13:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987269572] [2024-10-23 20:13:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987269572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525767431] [2024-10-23 20:13:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:44,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:44,704 INFO L87 Difference]: Start difference. First operand 1675 states and 2266 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-10-23 20:13:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:44,849 INFO L93 Difference]: Finished difference Result 3490 states and 4794 transitions. [2024-10-23 20:13:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:44,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 459 [2024-10-23 20:13:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:44,856 INFO L225 Difference]: With dead ends: 3490 [2024-10-23 20:13:44,856 INFO L226 Difference]: Without dead ends: 1840 [2024-10-23 20:13:44,859 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-10-23 20:13:44,859 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:44,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-10-23 20:13:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-10-23 20:13:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3355084284937466) internal successors, (2456), 1839 states have internal predecessors, (2456), 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-10-23 20:13:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2456 transitions. [2024-10-23 20:13:44,900 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2456 transitions. Word has length 459 [2024-10-23 20:13:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:44,901 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2456 transitions. [2024-10-23 20:13:44,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-10-23 20:13:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2456 transitions. [2024-10-23 20:13:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-10-23 20:13:44,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:44,933 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 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] [2024-10-23 20:13:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 20:13:44,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 460784419, now seen corresponding path program 1 times [2024-10-23 20:13:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178130863] [2024-10-23 20:13:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1680 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2024-10-23 20:13:45,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178130863] [2024-10-23 20:13:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178130863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:13:45,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:13:45,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:13:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77933428] [2024-10-23 20:13:45,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:13:45,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:13:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:13:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:13:45,062 INFO L87 Difference]: Start difference. First operand 1840 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-10-23 20:13:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:45,225 INFO L93 Difference]: Finished difference Result 3830 states and 5194 transitions. [2024-10-23 20:13:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:13:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 519 [2024-10-23 20:13:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:45,233 INFO L225 Difference]: With dead ends: 3830 [2024-10-23 20:13:45,234 INFO L226 Difference]: Without dead ends: 2015 [2024-10-23 20:13:45,236 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-10-23 20:13:45,237 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:45,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:13:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-10-23 20:13:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2015. [2024-10-23 20:13:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.3187686196623634) internal successors, (2656), 2014 states have internal predecessors, (2656), 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-10-23 20:13:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2656 transitions. [2024-10-23 20:13:45,281 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2656 transitions. Word has length 519 [2024-10-23 20:13:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:45,281 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2656 transitions. [2024-10-23 20:13:45,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-10-23 20:13:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2656 transitions. [2024-10-23 20:13:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2024-10-23 20:13:45,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:13:45,291 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 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] [2024-10-23 20:13:45,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 20:13:45,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:13:45,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:13:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash 855549795, now seen corresponding path program 1 times [2024-10-23 20:13:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:13:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979788436] [2024-10-23 20:13:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:13:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-23 20:13:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:13:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979788436] [2024-10-23 20:13:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979788436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:13:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356884351] [2024-10-23 20:13:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:13:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:13:45,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:13:45,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:13:45,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 20:13:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:13:45,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 20:13:45,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:13:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-23 20:13:45,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 20:13:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-23 20:13:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356884351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 20:13:45,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 20:13:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-23 20:13:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348976774] [2024-10-23 20:13:45,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 20:13:46,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-23 20:13:46,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:13:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-23 20:13:46,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-23 20:13:46,003 INFO L87 Difference]: Start difference. First operand 2015 states and 2656 transitions. Second operand has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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-10-23 20:13:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:13:46,509 INFO L93 Difference]: Finished difference Result 2879 states and 3810 transitions. [2024-10-23 20:13:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-23 20:13:46,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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 583 [2024-10-23 20:13:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:13:46,511 INFO L225 Difference]: With dead ends: 2879 [2024-10-23 20:13:46,511 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:13:46,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-23 20:13:46,514 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 191 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:13:46,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1431 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:13:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:13:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:13:46,516 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-10-23 20:13:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:13:46,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2024-10-23 20:13:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:13:46,516 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:13:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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-10-23 20:13:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:13:46,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:13:46,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:13:46,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-23 20:13:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-23 20:13:46,727 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] [2024-10-23 20:13:46,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:13:47,201 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:13:47,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:13:47 BoogieIcfgContainer [2024-10-23 20:13:47,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:13:47,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:13:47,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:13:47,230 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:13:47,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:13:38" (3/4) ... [2024-10-23 20:13:47,232 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:13:47,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-23 20:13:47,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-23 20:13:47,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:13:47,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:13:47,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:13:47,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:13:47,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:13:47,403 INFO L158 Benchmark]: Toolchain (without parser) took 10266.95ms. Allocated memory was 151.0MB in the beginning and 299.9MB in the end (delta: 148.9MB). Free memory was 93.1MB in the beginning and 155.9MB in the end (delta: -62.8MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,404 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:13:47,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.97ms. Allocated memory is still 151.0MB. Free memory was 92.8MB in the beginning and 75.0MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.80ms. Allocated memory is still 151.0MB. Free memory was 75.0MB in the beginning and 71.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,404 INFO L158 Benchmark]: Boogie Preprocessor took 81.91ms. Allocated memory is still 151.0MB. Free memory was 71.5MB in the beginning and 68.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,405 INFO L158 Benchmark]: RCFGBuilder took 903.82ms. Allocated memory is still 151.0MB. Free memory was 68.3MB in the beginning and 77.0MB in the end (delta: -8.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,405 INFO L158 Benchmark]: TraceAbstraction took 8652.18ms. Allocated memory was 151.0MB in the beginning and 299.9MB in the end (delta: 148.9MB). Free memory was 76.2MB in the beginning and 166.4MB in the end (delta: -90.2MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,405 INFO L158 Benchmark]: Witness Printer took 173.96ms. Allocated memory is still 299.9MB. Free memory was 166.4MB in the beginning and 155.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 20:13:47,407 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.17ms. Allocated memory is still 151.0MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.97ms. Allocated memory is still 151.0MB. Free memory was 92.8MB in the beginning and 75.0MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.80ms. Allocated memory is still 151.0MB. Free memory was 75.0MB in the beginning and 71.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.91ms. Allocated memory is still 151.0MB. Free memory was 71.5MB in the beginning and 68.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 903.82ms. Allocated memory is still 151.0MB. Free memory was 68.3MB in the beginning and 77.0MB in the end (delta: -8.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8652.18ms. Allocated memory was 151.0MB in the beginning and 299.9MB in the end (delta: 148.9MB). Free memory was 76.2MB in the beginning and 166.4MB in the end (delta: -90.2MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 173.96ms. Allocated memory is still 299.9MB. Free memory was 166.4MB in the beginning and 155.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 681]: 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, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1461 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1461 mSDsluCounter, 10059 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4828 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2787 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 5231 mSDtfsCounter, 2787 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1960 GetRequests, 1925 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2015occurred in iteration=19, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 638 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5329 NumberOfCodeBlocks, 5329 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6250 ConstructedInterpolants, 0 QuantifiedInterpolants, 8217 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1459 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 24854/25004 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: 109]: Loop Invariant Derived loop invariant: ((((((((((((((8464 == s__state) && (blastFlag == 0)) || ((2 == blastFlag) && (8560 == s__state))) || ((2 == blastFlag) && (s__state == 8512))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || (((s__state == 8656) && (2 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (s__state == 8672)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:13:47,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE