./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-08 10:22:13,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:13,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:13,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:13,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:13,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:13,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:13,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:13,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:13,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:13,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:13,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:13,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:13,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:13,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:13,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:13,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:13,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:13,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:13,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:13,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:13,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:13,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:13,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:13,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:13,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:13,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:13,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:13,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:13,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:13,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:13,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:13,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:13,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:13,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:13,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:13,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:13,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:13,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:13,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:13,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:13,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:13,112 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-11-08 10:22:13,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:13,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:13,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:13,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:13,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:13,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-11-08 10:22:14,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:15,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:15,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-11-08 10:22:15,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecdc2008/8367b0b99d454032b6b74b604638733a/FLAG9e8f88399 [2024-11-08 10:22:15,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecdc2008/8367b0b99d454032b6b74b604638733a [2024-11-08 10:22:15,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:15,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:15,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:15,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:15,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:15,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7cf768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15, skipping insertion in model container [2024-11-08 10:22:15,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:15,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-11-08 10:22:15,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:15,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:15,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-11-08 10:22:15,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:15,512 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:15,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15 WrapperNode [2024-11-08 10:22:15,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:15,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:15,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:15,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:15,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,568 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 644 [2024-11-08 10:22:15,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:15,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:15,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:15,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:15,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:15,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:15,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:15,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:15,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:15,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:15,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:15,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:15,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:15,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:15,772 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:15,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:15,795 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 10:22:16,162 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-11-08 10:22:16,163 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-11-08 10:22:16,197 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:16,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:16,208 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:16,208 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:22:16,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16 BoogieIcfgContainer [2024-11-08 10:22:16,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:16,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:16,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:16,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:16,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:15" (1/3) ... [2024-11-08 10:22:16,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f15ace9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:16, skipping insertion in model container [2024-11-08 10:22:16,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15" (2/3) ... [2024-11-08 10:22:16,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f15ace9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:16, skipping insertion in model container [2024-11-08 10:22:16,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16" (3/3) ... [2024-11-08 10:22:16,215 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-11-08 10:22:16,227 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:16,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:16,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:16,273 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;@fb4e18b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:16,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 168 states have (on average 1.7202380952380953) internal successors, (289), 169 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 10:22:16,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:16,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:16,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1471884862, now seen corresponding path program 1 times [2024-11-08 10:22:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110569154] [2024-11-08 10:22:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:16,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:16,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110569154] [2024-11-08 10:22:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110569154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579823177] [2024-11-08 10:22:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:16,718 INFO L87 Difference]: Start difference. First operand has 170 states, 168 states have (on average 1.7202380952380953) internal successors, (289), 169 states have internal predecessors, (289), 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 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:16,952 INFO L93 Difference]: Finished difference Result 373 states and 644 transitions. [2024-11-08 10:22:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:16,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2024-11-08 10:22:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:16,966 INFO L225 Difference]: With dead ends: 373 [2024-11-08 10:22:16,967 INFO L226 Difference]: Without dead ends: 198 [2024-11-08 10:22:16,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:16,973 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 58 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:16,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 360 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-08 10:22:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-08 10:22:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.6446700507614214) internal successors, (324), 197 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 324 transitions. [2024-11-08 10:22:17,019 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 324 transitions. Word has length 45 [2024-11-08 10:22:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,019 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 324 transitions. [2024-11-08 10:22:17,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 324 transitions. [2024-11-08 10:22:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 10:22:17,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:22:17,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1606373610, now seen corresponding path program 1 times [2024-11-08 10:22:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908048684] [2024-11-08 10:22:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908048684] [2024-11-08 10:22:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908048684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620100330] [2024-11-08 10:22:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,106 INFO L87 Difference]: Start difference. First operand 198 states and 324 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,249 INFO L93 Difference]: Finished difference Result 425 states and 707 transitions. [2024-11-08 10:22:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2024-11-08 10:22:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,251 INFO L225 Difference]: With dead ends: 425 [2024-11-08 10:22:17,251 INFO L226 Difference]: Without dead ends: 239 [2024-11-08 10:22:17,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,253 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 289 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-08 10:22:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-08 10:22:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.684873949579832) internal successors, (401), 238 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 401 transitions. [2024-11-08 10:22:17,274 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 401 transitions. Word has length 46 [2024-11-08 10:22:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,275 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 401 transitions. [2024-11-08 10:22:17,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 401 transitions. [2024-11-08 10:22:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 10:22:17,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:22:17,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 182167378, now seen corresponding path program 1 times [2024-11-08 10:22:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828805525] [2024-11-08 10:22:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828805525] [2024-11-08 10:22:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828805525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487670868] [2024-11-08 10:22:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,397 INFO L87 Difference]: Start difference. First operand 239 states and 401 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,498 INFO L93 Difference]: Finished difference Result 482 states and 812 transitions. [2024-11-08 10:22:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 74 [2024-11-08 10:22:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,501 INFO L225 Difference]: With dead ends: 482 [2024-11-08 10:22:17,503 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 10:22:17,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,505 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 26 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 375 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 10:22:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-08 10:22:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 424 transitions. [2024-11-08 10:22:17,524 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 424 transitions. Word has length 74 [2024-11-08 10:22:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,526 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 424 transitions. [2024-11-08 10:22:17,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 424 transitions. [2024-11-08 10:22:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 10:22:17,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:22:17,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1768782249, now seen corresponding path program 1 times [2024-11-08 10:22:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021293321] [2024-11-08 10:22:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:22:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021293321] [2024-11-08 10:22:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021293321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523715821] [2024-11-08 10:22:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,605 INFO L87 Difference]: Start difference. First operand 257 states and 424 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,702 INFO L93 Difference]: Finished difference Result 521 states and 864 transitions. [2024-11-08 10:22:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 90 [2024-11-08 10:22:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,704 INFO L225 Difference]: With dead ends: 521 [2024-11-08 10:22:17,704 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 10:22:17,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,708 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 390 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 10:22:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-08 10:22:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.6245487364620939) internal successors, (450), 277 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 450 transitions. [2024-11-08 10:22:17,723 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 450 transitions. Word has length 90 [2024-11-08 10:22:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,723 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 450 transitions. [2024-11-08 10:22:17,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 450 transitions. [2024-11-08 10:22:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 10:22:17,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,729 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-08 10:22:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:22:17,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 576709694, now seen corresponding path program 1 times [2024-11-08 10:22:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2580562] [2024-11-08 10:22:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 10:22:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2580562] [2024-11-08 10:22:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2580562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666614585] [2024-11-08 10:22:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,774 INFO L87 Difference]: Start difference. First operand 278 states and 450 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,897 INFO L93 Difference]: Finished difference Result 593 states and 968 transitions. [2024-11-08 10:22:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 111 [2024-11-08 10:22:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,898 INFO L225 Difference]: With dead ends: 593 [2024-11-08 10:22:17,899 INFO L226 Difference]: Without dead ends: 329 [2024-11-08 10:22:17,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,900 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 35 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 378 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-08 10:22:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2024-11-08 10:22:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 472 transitions. [2024-11-08 10:22:17,907 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 472 transitions. Word has length 111 [2024-11-08 10:22:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,908 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 472 transitions. [2024-11-08 10:22:17,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 472 transitions. [2024-11-08 10:22:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 10:22:17,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,909 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-08 10:22:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:22:17,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash -390640960, now seen corresponding path program 1 times [2024-11-08 10:22:17,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294517144] [2024-11-08 10:22:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:22:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294517144] [2024-11-08 10:22:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294517144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259994171] [2024-11-08 10:22:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,953 INFO L87 Difference]: Start difference. First operand 319 states and 472 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-11-08 10:22:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,042 INFO L93 Difference]: Finished difference Result 647 states and 964 transitions. [2024-11-08 10:22:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,043 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 111 [2024-11-08 10:22:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,044 INFO L225 Difference]: With dead ends: 647 [2024-11-08 10:22:18,044 INFO L226 Difference]: Without dead ends: 342 [2024-11-08 10:22:18,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,045 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 406 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-08 10:22:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-08 10:22:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.466275659824047) internal successors, (500), 341 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 500 transitions. [2024-11-08 10:22:18,052 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 500 transitions. Word has length 111 [2024-11-08 10:22:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 500 transitions. [2024-11-08 10:22:18,052 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-11-08 10:22:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 500 transitions. [2024-11-08 10:22:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:18,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,053 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-08 10:22:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:22:18,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash -177404595, now seen corresponding path program 1 times [2024-11-08 10:22:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106526959] [2024-11-08 10:22:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 10:22:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106526959] [2024-11-08 10:22:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106526959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378709214] [2024-11-08 10:22:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,126 INFO L87 Difference]: Start difference. First operand 342 states and 500 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,152 INFO L93 Difference]: Finished difference Result 992 states and 1450 transitions. [2024-11-08 10:22:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 122 [2024-11-08 10:22:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,155 INFO L225 Difference]: With dead ends: 992 [2024-11-08 10:22:18,155 INFO L226 Difference]: Without dead ends: 664 [2024-11-08 10:22:18,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,158 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 171 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 672 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-08 10:22:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2024-11-08 10:22:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4570135746606334) internal successors, (966), 663 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 966 transitions. [2024-11-08 10:22:18,171 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 966 transitions. Word has length 122 [2024-11-08 10:22:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,172 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 966 transitions. [2024-11-08 10:22:18,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 966 transitions. [2024-11-08 10:22:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:18,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,174 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-08 10:22:18,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:22:18,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1074797873, now seen corresponding path program 1 times [2024-11-08 10:22:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649440485] [2024-11-08 10:22:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 10:22:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649440485] [2024-11-08 10:22:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649440485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989422165] [2024-11-08 10:22:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,234 INFO L87 Difference]: Start difference. First operand 664 states and 966 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-11-08 10:22:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,265 INFO L93 Difference]: Finished difference Result 1596 states and 2333 transitions. [2024-11-08 10:22:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,265 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 122 [2024-11-08 10:22:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,268 INFO L225 Difference]: With dead ends: 1596 [2024-11-08 10:22:18,268 INFO L226 Difference]: Without dead ends: 946 [2024-11-08 10:22:18,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,272 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 173 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 512 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-11-08 10:22:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2024-11-08 10:22:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 1.4634920634920634) internal successors, (1383), 945 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1383 transitions. [2024-11-08 10:22:18,289 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1383 transitions. Word has length 122 [2024-11-08 10:22:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,289 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1383 transitions. [2024-11-08 10:22:18,289 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-11-08 10:22:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1383 transitions. [2024-11-08 10:22:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:18,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,291 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-08 10:22:18,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:22:18,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1341038477, now seen corresponding path program 1 times [2024-11-08 10:22:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138110931] [2024-11-08 10:22:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 10:22:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138110931] [2024-11-08 10:22:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138110931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849879849] [2024-11-08 10:22:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,328 INFO L87 Difference]: Start difference. First operand 946 states and 1383 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,354 INFO L93 Difference]: Finished difference Result 1902 states and 2774 transitions. [2024-11-08 10:22:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 122 [2024-11-08 10:22:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,358 INFO L225 Difference]: With dead ends: 1902 [2024-11-08 10:22:18,358 INFO L226 Difference]: Without dead ends: 970 [2024-11-08 10:22:18,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,362 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 10 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 486 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-08 10:22:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2024-11-08 10:22:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.457172342621259) internal successors, (1412), 969 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1412 transitions. [2024-11-08 10:22:18,394 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1412 transitions. Word has length 122 [2024-11-08 10:22:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,394 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1412 transitions. [2024-11-08 10:22:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1412 transitions. [2024-11-08 10:22:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:18,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,396 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-08 10:22:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:22:18,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -692355569, now seen corresponding path program 1 times [2024-11-08 10:22:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637070737] [2024-11-08 10:22:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-08 10:22:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637070737] [2024-11-08 10:22:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637070737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452623518] [2024-11-08 10:22:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,428 INFO L87 Difference]: Start difference. First operand 970 states and 1412 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,453 INFO L93 Difference]: Finished difference Result 1939 states and 2816 transitions. [2024-11-08 10:22:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 122 [2024-11-08 10:22:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,458 INFO L225 Difference]: With dead ends: 1939 [2024-11-08 10:22:18,458 INFO L226 Difference]: Without dead ends: 983 [2024-11-08 10:22:18,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,460 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 15 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 456 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-08 10:22:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2024-11-08 10:22:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 1.4511201629327901) internal successors, (1425), 982 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1425 transitions. [2024-11-08 10:22:18,480 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1425 transitions. Word has length 122 [2024-11-08 10:22:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,480 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1425 transitions. [2024-11-08 10:22:18,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1425 transitions. [2024-11-08 10:22:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 10:22:18,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,483 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:18,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:22:18,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2034030260, now seen corresponding path program 1 times [2024-11-08 10:22:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254166110] [2024-11-08 10:22:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-08 10:22:18,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254166110] [2024-11-08 10:22:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254166110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55246862] [2024-11-08 10:22:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,558 INFO L87 Difference]: Start difference. First operand 983 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,677 INFO L93 Difference]: Finished difference Result 1963 states and 2848 transitions. [2024-11-08 10:22:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 202 [2024-11-08 10:22:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,681 INFO L225 Difference]: With dead ends: 1963 [2024-11-08 10:22:18,681 INFO L226 Difference]: Without dead ends: 1007 [2024-11-08 10:22:18,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,683 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 77 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 303 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-11-08 10:22:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2024-11-08 10:22:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.422465208747515) internal successors, (1431), 1006 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1431 transitions. [2024-11-08 10:22:18,699 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1431 transitions. Word has length 202 [2024-11-08 10:22:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1431 transitions. [2024-11-08 10:22:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1431 transitions. [2024-11-08 10:22:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 10:22:18,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,702 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2024-11-08 10:22:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:22:18,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1018424956, now seen corresponding path program 1 times [2024-11-08 10:22:18,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304804768] [2024-11-08 10:22:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-08 10:22:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304804768] [2024-11-08 10:22:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304804768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181863154] [2024-11-08 10:22:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,765 INFO L87 Difference]: Start difference. First operand 1007 states and 1431 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,880 INFO L93 Difference]: Finished difference Result 2080 states and 2992 transitions. [2024-11-08 10:22:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 232 [2024-11-08 10:22:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,885 INFO L225 Difference]: With dead ends: 2080 [2024-11-08 10:22:18,885 INFO L226 Difference]: Without dead ends: 1100 [2024-11-08 10:22:18,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,887 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 403 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-11-08 10:22:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1100. [2024-11-08 10:22:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 1.4003639672429482) internal successors, (1539), 1099 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1539 transitions. [2024-11-08 10:22:18,904 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1539 transitions. Word has length 232 [2024-11-08 10:22:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,904 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1539 transitions. [2024-11-08 10:22:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1539 transitions. [2024-11-08 10:22:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-08 10:22:18,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,907 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 10:22:18,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:22:18,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -879791816, now seen corresponding path program 2 times [2024-11-08 10:22:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:18,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333112256] [2024-11-08 10:22:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-08 10:22:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333112256] [2024-11-08 10:22:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333112256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756269329] [2024-11-08 10:22:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:18,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:18,986 INFO L87 Difference]: Start difference. First operand 1100 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:19,106 INFO L93 Difference]: Finished difference Result 2296 states and 3265 transitions. [2024-11-08 10:22:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:19,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 261 [2024-11-08 10:22:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:19,111 INFO L225 Difference]: With dead ends: 2296 [2024-11-08 10:22:19,111 INFO L226 Difference]: Without dead ends: 1095 [2024-11-08 10:22:19,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,112 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 19 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:19,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 406 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-08 10:22:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2024-11-08 10:22:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3948811700182815) internal successors, (1526), 1094 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1526 transitions. [2024-11-08 10:22:19,129 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1526 transitions. Word has length 261 [2024-11-08 10:22:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:19,130 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1526 transitions. [2024-11-08 10:22:19,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1526 transitions. [2024-11-08 10:22:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-08 10:22:19,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:19,133 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1] [2024-11-08 10:22:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:22:19,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -626054701, now seen corresponding path program 1 times [2024-11-08 10:22:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629000861] [2024-11-08 10:22:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-08 10:22:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629000861] [2024-11-08 10:22:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629000861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510371842] [2024-11-08 10:22:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:19,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,220 INFO L87 Difference]: Start difference. First operand 1095 states and 1526 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:19,251 INFO L93 Difference]: Finished difference Result 3115 states and 4372 transitions. [2024-11-08 10:22:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:19,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 272 [2024-11-08 10:22:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:19,255 INFO L225 Difference]: With dead ends: 3115 [2024-11-08 10:22:19,255 INFO L226 Difference]: Without dead ends: 1389 [2024-11-08 10:22:19,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,258 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 157 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:19,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 654 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-08 10:22:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1385. [2024-11-08 10:22:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 1.4002890173410405) internal successors, (1938), 1384 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1938 transitions. [2024-11-08 10:22:19,285 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1938 transitions. Word has length 272 [2024-11-08 10:22:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1938 transitions. [2024-11-08 10:22:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1938 transitions. [2024-11-08 10:22:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-08 10:22:19,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:19,289 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:22:19,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash 110068044, now seen corresponding path program 1 times [2024-11-08 10:22:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49943779] [2024-11-08 10:22:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-11-08 10:22:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49943779] [2024-11-08 10:22:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49943779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:19,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:19,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618020146] [2024-11-08 10:22:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,342 INFO L87 Difference]: Start difference. First operand 1385 states and 1938 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:19,438 INFO L93 Difference]: Finished difference Result 2843 states and 4009 transitions. [2024-11-08 10:22:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 293 [2024-11-08 10:22:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:19,443 INFO L225 Difference]: With dead ends: 2843 [2024-11-08 10:22:19,443 INFO L226 Difference]: Without dead ends: 1485 [2024-11-08 10:22:19,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,445 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:19,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 400 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-08 10:22:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2024-11-08 10:22:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 1.3867924528301887) internal successors, (2058), 1484 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2058 transitions. [2024-11-08 10:22:19,467 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2058 transitions. Word has length 293 [2024-11-08 10:22:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:19,467 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2058 transitions. [2024-11-08 10:22:19,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2058 transitions. [2024-11-08 10:22:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-08 10:22:19,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:19,470 INFO L215 NwaCegarLoop]: trace histogram [10, 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, 1, 1] [2024-11-08 10:22:19,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:22:19,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1612324397, now seen corresponding path program 1 times [2024-11-08 10:22:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029733435] [2024-11-08 10:22:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-08 10:22:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029733435] [2024-11-08 10:22:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029733435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519246086] [2024-11-08 10:22:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:19,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,521 INFO L87 Difference]: Start difference. First operand 1485 states and 2058 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-11-08 10:22:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:19,640 INFO L93 Difference]: Finished difference Result 3051 states and 4265 transitions. [2024-11-08 10:22:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:19,641 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 320 [2024-11-08 10:22:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:19,645 INFO L225 Difference]: With dead ends: 3051 [2024-11-08 10:22:19,646 INFO L226 Difference]: Without dead ends: 1593 [2024-11-08 10:22:19,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,647 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:19,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 400 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2024-11-08 10:22:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2024-11-08 10:22:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1592 states have (on average 1.3731155778894473) internal successors, (2186), 1592 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2186 transitions. [2024-11-08 10:22:19,669 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2186 transitions. Word has length 320 [2024-11-08 10:22:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:19,669 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2186 transitions. [2024-11-08 10:22:19,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-11-08 10:22:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2186 transitions. [2024-11-08 10:22:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-08 10:22:19,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:19,672 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 1, 1] [2024-11-08 10:22:19,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 10:22:19,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1688482013, now seen corresponding path program 1 times [2024-11-08 10:22:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070149163] [2024-11-08 10:22:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-08 10:22:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070149163] [2024-11-08 10:22:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070149163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958268639] [2024-11-08 10:22:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,728 INFO L87 Difference]: Start difference. First operand 1593 states and 2186 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:19,830 INFO L93 Difference]: Finished difference Result 3275 states and 4537 transitions. [2024-11-08 10:22:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 343 [2024-11-08 10:22:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:19,835 INFO L225 Difference]: With dead ends: 3275 [2024-11-08 10:22:19,835 INFO L226 Difference]: Without dead ends: 1709 [2024-11-08 10:22:19,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:19,837 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:19,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 400 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-11-08 10:22:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1709. [2024-11-08 10:22:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.3594847775175645) internal successors, (2322), 1708 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2322 transitions. [2024-11-08 10:22:19,860 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2322 transitions. Word has length 343 [2024-11-08 10:22:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:19,860 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2322 transitions. [2024-11-08 10:22:19,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2322 transitions. [2024-11-08 10:22:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-08 10:22:19,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:19,864 INFO L215 NwaCegarLoop]: trace histogram [12, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:22:19,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:19,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1121614667, now seen corresponding path program 1 times [2024-11-08 10:22:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810568511] [2024-11-08 10:22:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 10:22:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:19,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810568511] [2024-11-08 10:22:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810568511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:19,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981204615] [2024-11-08 10:22:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:19,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:19,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:22:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:20,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:22:20,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 10:22:20,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 10:22:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981204615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:20,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:20,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 10:22:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891263136] [2024-11-08 10:22:20,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:20,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:20,319 INFO L87 Difference]: Start difference. First operand 1709 states and 2322 transitions. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:20,653 INFO L93 Difference]: Finished difference Result 4150 states and 5713 transitions. [2024-11-08 10:22:20,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:22:20,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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 377 [2024-11-08 10:22:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:20,660 INFO L225 Difference]: With dead ends: 4150 [2024-11-08 10:22:20,660 INFO L226 Difference]: Without dead ends: 2359 [2024-11-08 10:22:20,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 756 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-11-08 10:22:20,663 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 522 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:20,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1025 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:22:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-11-08 10:22:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1733. [2024-11-08 10:22:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.3469976905311778) internal successors, (2333), 1732 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2333 transitions. [2024-11-08 10:22:20,693 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2333 transitions. Word has length 377 [2024-11-08 10:22:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:20,694 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2333 transitions. [2024-11-08 10:22:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2333 transitions. [2024-11-08 10:22:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-11-08 10:22:20,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:20,699 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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] [2024-11-08 10:22:20,719 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-11-08 10:22:20,900 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,SelfDestructingSolverStorable17 [2024-11-08 10:22:20,900 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:20,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash 642035125, now seen corresponding path program 1 times [2024-11-08 10:22:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268248948] [2024-11-08 10:22:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:20,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-08 10:22:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268248948] [2024-11-08 10:22:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268248948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896217394] [2024-11-08 10:22:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:21,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:21,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:21,044 INFO L87 Difference]: Start difference. First operand 1733 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:21,238 INFO L93 Difference]: Finished difference Result 3609 states and 4931 transitions. [2024-11-08 10:22:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 477 [2024-11-08 10:22:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:21,243 INFO L225 Difference]: With dead ends: 3609 [2024-11-08 10:22:21,243 INFO L226 Difference]: Without dead ends: 1903 [2024-11-08 10:22:21,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:21,245 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:21,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 392 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-11-08 10:22:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2024-11-08 10:22:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1902 states have (on average 1.3291272344900105) internal successors, (2528), 1902 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2528 transitions. [2024-11-08 10:22:21,272 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2528 transitions. Word has length 477 [2024-11-08 10:22:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:21,272 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2528 transitions. [2024-11-08 10:22:21,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2528 transitions. [2024-11-08 10:22:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2024-11-08 10:22:21,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:21,277 INFO L215 NwaCegarLoop]: trace histogram [17, 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, 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] [2024-11-08 10:22:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 10:22:21,277 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1264063619, now seen corresponding path program 1 times [2024-11-08 10:22:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075891610] [2024-11-08 10:22:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-11-08 10:22:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075891610] [2024-11-08 10:22:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075891610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:21,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869842235] [2024-11-08 10:22:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:21,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:21,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:21,364 INFO L87 Difference]: Start difference. First operand 1903 states and 2528 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:21,610 INFO L93 Difference]: Finished difference Result 3959 states and 5341 transitions. [2024-11-08 10:22:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 539 [2024-11-08 10:22:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:21,616 INFO L225 Difference]: With dead ends: 3959 [2024-11-08 10:22:21,616 INFO L226 Difference]: Without dead ends: 2083 [2024-11-08 10:22:21,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:21,620 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:21,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 392 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2024-11-08 10:22:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083. [2024-11-08 10:22:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.3126801152737753) internal successors, (2733), 2082 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2733 transitions. [2024-11-08 10:22:21,659 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2733 transitions. Word has length 539 [2024-11-08 10:22:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:21,659 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 2733 transitions. [2024-11-08 10:22:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2733 transitions. [2024-11-08 10:22:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2024-11-08 10:22:21,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:21,669 INFO L215 NwaCegarLoop]: trace histogram [19, 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, 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] [2024-11-08 10:22:21,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 10:22:21,669 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:21,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1040446763, now seen corresponding path program 1 times [2024-11-08 10:22:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697767701] [2024-11-08 10:22:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2024-11-08 10:22:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697767701] [2024-11-08 10:22:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697767701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630436626] [2024-11-08 10:22:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:21,877 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-11-08 10:22:21,881 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-11-08 10:22:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:22,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:22:22,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2024-11-08 10:22:22,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2024-11-08 10:22:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630436626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:22,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-08 10:22:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287297361] [2024-11-08 10:22:22,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:22:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:22:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:22,306 INFO L87 Difference]: Start difference. First operand 2083 states and 2733 transitions. Second operand has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:22,651 INFO L93 Difference]: Finished difference Result 2979 states and 3922 transitions. [2024-11-08 10:22:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 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 605 [2024-11-08 10:22:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:22,653 INFO L225 Difference]: With dead ends: 2979 [2024-11-08 10:22:22,653 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:22:22,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 1209 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-11-08 10:22:22,655 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 200 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:22,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1584 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:22:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:22:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:22:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:22:22,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 605 [2024-11-08 10:22:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:22,657 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:22:22,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:22:22,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:22:22,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:22,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:22:22,863 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,SelfDestructingSolverStorable20 [2024-11-08 10:22:22,866 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:22,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:22:23,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:23,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:23 BoogieIcfgContainer [2024-11-08 10:22:23,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:23,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:23,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:23,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:23,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16" (3/4) ... [2024-11-08 10:22:23,179 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:22:23,188 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-08 10:22:23,189 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:22:23,190 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:22:23,190 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:22:23,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:22:23,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:22:23,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:23,274 INFO L158 Benchmark]: Toolchain (without parser) took 8143.39ms. Allocated memory was 169.9MB in the beginning and 314.6MB in the end (delta: 144.7MB). Free memory was 141.1MB in the beginning and 95.4MB in the end (delta: 45.7MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,274 INFO L158 Benchmark]: CDTParser took 3.66ms. Allocated memory is still 121.6MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:23,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.41ms. Allocated memory is still 169.9MB. Free memory was 141.1MB in the beginning and 123.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.22ms. Allocated memory is still 169.9MB. Free memory was 123.1MB in the beginning and 119.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,275 INFO L158 Benchmark]: Boogie Preprocessor took 39.98ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 116.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,275 INFO L158 Benchmark]: RCFGBuilder took 599.44ms. Allocated memory is still 169.9MB. Free memory was 116.0MB in the beginning and 128.7MB in the end (delta: -12.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,275 INFO L158 Benchmark]: TraceAbstraction took 6966.39ms. Allocated memory was 169.9MB in the beginning and 314.6MB in the end (delta: 144.7MB). Free memory was 127.6MB in the beginning and 105.9MB in the end (delta: 21.8MB). Peak memory consumption was 167.5MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,276 INFO L158 Benchmark]: Witness Printer took 96.85ms. Allocated memory is still 314.6MB. Free memory was 105.9MB in the beginning and 95.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 10:22:23,279 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.66ms. Allocated memory is still 121.6MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.41ms. Allocated memory is still 169.9MB. Free memory was 141.1MB in the beginning and 123.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.22ms. Allocated memory is still 169.9MB. Free memory was 123.1MB in the beginning and 119.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.98ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 116.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 599.44ms. Allocated memory is still 169.9MB. Free memory was 116.0MB in the beginning and 128.7MB in the end (delta: -12.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6966.39ms. Allocated memory was 169.9MB in the beginning and 314.6MB in the end (delta: 144.7MB). Free memory was 127.6MB in the beginning and 105.9MB in the end (delta: 21.8MB). Peak memory consumption was 167.5MB. Max. memory is 16.1GB. * Witness Printer took 96.85ms. Allocated memory is still 314.6MB. Free memory was 105.9MB in the beginning and 95.4MB 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, 170 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 21, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1583 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1583 mSDsluCounter, 10683 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5156 mSDsCounter, 405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2803 IncrementalHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 405 mSolverCounterUnsat, 5527 mSDtfsCounter, 2803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2039 GetRequests, 2003 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2083occurred in iteration=20, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 640 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5868 NumberOfCodeBlocks, 5868 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6825 ConstructedInterpolants, 0 QuantifiedInterpolants, 9012 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1514 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 27115/27271 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))) || ((((3 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (8656 <= s__state)) && (s__state <= 8672))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || ((((2 == blastFlag) && (s__state != 8672)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8672))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:22:23,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE